Sciweavers

1054 search results - page 9 / 211
» Capacitated Domination Problem
Sort
View
MP
2002
86views more  MP 2002»
13 years 7 months ago
Multistars, partial multistars and the capacitated vehicle routing problem
In an unpublished paper, Araque, Hall and Magnanti considered polyhedra associated with the Capacitated Vehicle Routing Problem (CVRP) in the special case of unit demands. Among th...
Adam N. Letchford, Richard W. Eglese, Jens Lysgaar...
MP
2008
137views more  MP 2008»
13 years 7 months ago
Valid inequalities and restrictions for stochastic programming problems with first order stochastic dominance constraints
Stochastic dominance relations are well-studied in statistics, decision theory and economics. Recently, there has been significant interest in introducing dominance relations into...
Nilay Noyan, Andrzej Ruszczynski
COR
2007
90views more  COR 2007»
13 years 7 months ago
Analysis of bounds for a capacitated single-item lot-sizing problem
Lot-sizing problems are cornerstone optimization problems for production planning with time varying demand. We analyze the quality of bounds, both lower and upper, provided by a r...
Jill R. Hardin, George L. Nemhauser, Martin W. P. ...
INFORMS
2008
241views more  INFORMS 2008»
13 years 7 months ago
Solving the Capacitated Local Access Network Design Problem
We propose an exact solution method for a routing and capacity installation problem in networks. Given an input graph, the problem is to route traffic from a set of source nodes t...
F. Sibel Salman, R. Ravi, John N. Hooker
EOR
2007
69views more  EOR 2007»
13 years 7 months ago
The shortest multipaths problem in a capacitated dense channel
Abstract. In this paper, we present a simple polynomial-time algorithm solving the shortest multipaths problem in particular grid graphs called dense channels. Our work extends the...
Cédric Bentz, Marie-Christine Costa, Christ...