Sciweavers

236 search results - page 23 / 48
» On the Vehicle Routing Problem with lower bound capacities
Sort
View
SIAMDM
2010
128views more  SIAMDM 2010»
15 years 4 months ago
Permutation Capacities of Families of Oriented Infinite Paths
K¨orner and Malvenuto asked whether one can find n n/2 linear orderings (i.e., permutations) of the first n natural numbers such that any pair of them places two consecutive int...
Graham Brightwell, Gérard D. Cohen, Emanuel...
AAIM
2009
Springer
143views Algorithms» more  AAIM 2009»
15 years 3 months ago
Discrete online TSP
In this paper we introduce a discrete version of the online traveling salesman problem (DOLTSP). We represent the metric space using a weighted graph, where the server is allowed t...
Mauro Aprea, Esteban Feuerstein, Gustavo Sadovoy, ...
AIPS
2007
15 years 8 months ago
The Manpower Allocation Problem with Time Windows and Job-Teaming Constraints
The Manpower Allocation Problem with Time Windows, Job-Teaming Constraints and a limited number of teams (mMAPTWTC) is a crew scheduling problem faced in several different context...
Anders Dohn, Esben Kolind, Jens Clausen
TON
2012
13 years 8 months ago
Static Routing and Wavelength Assignment for Multicast Advance Reservation in All-Optical Wavelength-Routed WDM Networks
—In this paper we investigate the static multicast advance reservation (MCAR) problem for all-optical wavelengthrouted WDM networks. Under the advanced reservation traffic model...
Neal Charbonneau, Vinod Vokkarane
CORR
2007
Springer
120views Education» more  CORR 2007»
15 years 6 months ago
On the Feedback Capacity of Power Constrained Gaussian Noise Channels with Memory
—For a stationary additive Gaussian-noise channel with a rational noise power spectrum of a finite-order L, we derive two new results for the feedback capacity under an average ...
Shaohua Yang, Aleksandar Kavcic, Sekhar Tatikonda