Sciweavers

549 search results - page 98 / 110
» The corner arc algorithm
Sort
View
DISOPT
2010
138views more  DISOPT 2010»
13 years 7 months ago
The Delivery Man Problem with time windows
In this paper, a variant of the Traveling Salesman Problem with Time Windows is considered, which consists in minimizing the sum of travel durations between a depot and several cu...
Géraldine Heilporn, Jean-François Co...
DISOPT
2008
91views more  DISOPT 2008»
13 years 7 months ago
Partition inequalities for capacitated survivable network design based on directed p-cycles
We study the design of capacitated survivable networks using directed p-cycles. A p-cycle is a cycle with at least three arcs, used for rerouting disrupted flow during edge failur...
Alper Atamtürk, Deepak Rajan
AMC
2006
100views more  AMC 2006»
13 years 7 months ago
Reliability evaluation of multi-component cold-standby redundant systems
A new methodology for the reliability evaluation of an l-dissimilar-unit non-repairable cold-standby redundant system is introduced in this paper. Each unit is composed of a numbe...
Amir Azaron, Hideki Katagiri, Kosuke Kato, Masatos...
JAIR
2008
98views more  JAIR 2008»
13 years 7 months ago
Loosely Coupled Formulations for Automated Planning: An Integer Programming Perspective
We represent planning as a set of loosely coupled network flow problems, where each network corresponds to one of the state variables in the planning domain. The network nodes cor...
Menkes Hector Louis van den Briel, Thomas Vossen, ...
AI
2011
Springer
13 years 2 months ago
The extended global cardinality constraint: An empirical survey
The Extended Global Cardinality Constraint (EGCC) is a vital component of constraint solving systems, since it is very widely used to model diverse problems. The literature contai...
Peter Nightingale