480 search results - page 4 / 96 » Approximate and exact algorithms for the fixed-charge knapsa... |
IFIP
2007
Springer
14 years 1 months ago
2007
Springer
COCOON
2010
Springer
14 years 2 days ago
2010
Springer
ESA
2005
Springer
14 years 1 months ago
2005
Springer
This paper investigates, for the first time in the literature, the approximation of min-max (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
IPCO
2007
13 years 9 months ago
2007
During the last decades, much research has been conducted deriving classes of valid inequalities for single-row mixed integer programming polyhedrons. However, no such class has ha...
WADS
2009
Springer
14 years 2 months ago
2009
Springer
In this paper, we study the two-dimensional geometrical bin packing problem (2DBP): given a list of rectangles, provide a packing of all these into the smallest possible number of ...