Sciweavers

8413 search results - page 24 / 1683
» Ordering Problem Subgoals
Sort
View
EOR
2008
85views more  EOR 2008»
13 years 8 months ago
The Linear Ordering Problem with cumulative costs
Several optimization problems require finding a permutation of a given set of items that minimizes a certain cost function. These problems are naturally modelled in graph-theory t...
Livio Bertacco, Lorenzo Brunetta, Matteo Fischetti
APAL
2011
13 years 2 months ago
The provably total NP search problems of weak second order bounded arithmetic
We define a new NP search problem, the “local improvement” principle, about labellings of an acyclic, bounded-degree graph. We show that, provably in PV, it characterizes the...
Leszek Aleksander Kolodziejczyk, Phuong Nguyen, Ne...
KES
2005
Springer
14 years 1 months ago
A Robust Approach for Improving Computational Efficiency of Order-Picking Problems
The new market forces have affected the operation of distribution centers (DCs) extremely. The DCs demand an increased productivity and a low cost in their daily operation. This pa...
Yu-Min Chiang, Shih-Hsin Chen, Kuo-Chang Wu
PVM
2004
Springer
14 years 1 months ago
A Message Ordering Problem in Parallel Programs
We consider a certain class of parallel program segments in which the order of messages sent affects the completion time. We give characterization of these parallel program segmen...
Bora Uçar, Cevdet Aykanat
CPAIOR
2006
Springer
13 years 11 months ago
Conditional Lexicographic Orders in Constraint Satisfaction Problems
The lexicographically-ordered CSP ("lexicographic CSP" for short) combines a simple representation of preferences with the feasibility constraints of ordinary CSPs. Prefe...
Richard J. Wallace, Nic Wilson