Sciweavers

193 search results - page 2 / 39
» The Capacitated m-Ring-Star Problem
Sort
View
WADS
2005
Springer
122views Algorithms» more  WADS 2005»
14 years 25 days ago
Parameterized Complexity of Generalized Vertex Cover Problems
Important generalizations of the Vertex Cover problem (Connected Vertex Cover, Capacitated Vertex Cover, and Maximum Partial Vertex Cover) have been intensively studied in terms of...
Jiong Guo, Rolf Niedermeier, Sebastian Wernicke
EOR
2008
105views more  EOR 2008»
13 years 6 months ago
The multi-item capacitated lot-sizing problem with setup times and shortage costs
We address a multi-item capacitated lot-sizing problem with setup times and shortage costs that arises in real-world production planning problems. Demand cannot be backlogged, but...
Nabil Absi, Safia Kedad-Sidhoum
GI
2007
Springer
14 years 1 months ago
The Collaborative Carrier Vehicle Routing Problem for Capacitated Traveling Salesman Tours
Abstract: This paper concentrates on a new framework for a post-market reassignment of requests in a Collaborative Carrier Network (CCN). While the framework was applied to a picku...
Susanne Berger, Christian Bierwirth
EUROCAST
2007
Springer
126views Hardware» more  EUROCAST 2007»
14 years 1 months ago
Parallel Tabu Search and the Multiobjective Capacitated Vehicle Routing Problem with Soft Time Windows
Abstract. In this paper the author presents three approaches to parallel Tabu Search, applied to several instances of the Capacitated Vehicle Routing Problem with soft Time Windows...
Andreas Beham
HEURISTICS
2002
155views more  HEURISTICS 2002»
13 years 7 months ago
Bounds and Heuristics for the Shortest Capacitated Paths Problem
Given a graph G, the Shortest Capacitated Paths Problem (SCPP) consists of determining a set of paths of least total length, linking given pairs of vertices in G, and satisfying c...
Marie-Christine Costa, Alain Hertz, Michel Mittaz