CPAIOR
12 years 8 months ago
2011 Springer 
Abstract. The almost square rectangle packing problem involves packing all rectangles with sizes 1 × 2 to n × (n + 1) (almost squares) into an enclosing rectangle of minimal area...
CPAIOR
12 years 8 months ago
2011 Springer 
In this work we present the Partner Units Problem as a novel challenge for optimization methods. It captures a certain type of configuration problem that frequently occurs in indu...
CPAIOR
12 years 8 months ago
2011 Springer 
We introduce the Upgrading Shortest Paths Problem, a new combinatorial problem for improving network connectivity with a wide range of applications from multicast communication to ...
CPAIOR
12 years 8 months ago
2011 Springer 
Abstract. We study the application of limited-width MDDs (multivalued decision diagrams) as discrete relaxations for combinatorial optimization problems. These relaxations are used...
|
Operations Research