Sciweavers

7 search results - page 1 / 2
» Solving the variable size bin packing problem with discretiz...
Sort
View
COR
2008
99views more  COR 2008»
13 years 4 months ago
Solving the variable size bin packing problem with discretized formulations
Isabel Correia, Luís Gouveia, Francisco Sal...
CPAIOR
2009
Springer
13 years 11 months ago
Modelling Search Strategies in Rules2CP
In this abstract, we present a rule-based modelling language for constraint programming, called Rules2CP [1], and a library PKML for modelling packing problems. Unlike other modell...
François Fages, Julien Martin
TON
2010
118views more  TON 2010»
13 years 3 months ago
ILP formulations for p-cycle design without candidate cycle enumeration
—The concept of p-cycle (preconfigured protection cycle) allows fast and efficient span protection in wavelength division multiplexing (WDM) mesh networks. To design p-cycles f...
Bin Wu, Kwan L. Yeung, Pin-Han Ho
CCE
2004
13 years 4 months ago
Optimal scheduling of multiproduct pipeline systems using a non-discrete MILP formulation
Multiproduct pipelines permit to transport large volumes of a wide range of refined petroleum products from major supply sources to distribution centers near market areas. Batches...
Diego C. Cafaro, Jaime Cerdá
COCOA
2007
Springer
13 years 11 months ago
On Threshold BDDs and the Optimal Variable Ordering Problem
Abstract. Many combinatorial optimization problems can be formulated as 0/1 integer programs (0/1 IPs). The investigation of the structure of these problems raises the following ta...
Markus Behle