International audienceThe G12 project is developing a software environment for stating and solving combinatorial problems by mapping a high-level model of the problem to an efficient combination of solving methods. Model annotations are used to control this process. In this paper we explain the mapping to branch-and-price solving. G12 supports the selection of specialised sub-problem solvers, the aggregation of identical sub-problems, automatic disaggregation when required by search, and the use of specialised branching rules. We demonstrate the benefits of the G12 framework on three examples: a trucking problem, cutting stock, and two-dimensional bin packing
We show how to extend the integer programming (IP) approach to score-based causal discovery by inclu...
International audienceWe consider the three-stage two-dimensional bin packing problem (2BP) which oc...
We present two efficient branch and price algorithms to solve the maximum cardinality and the dual b...
International audienceThe G12 project is developing a software environment for stating and solving c...
The G12 project is developing a software environment for stating and solving combinatorial problems ...
International audienceThe G12 project is developing a software environment for stating and solving c...
The G12 project recently started by National IGT Australia (NICTA) is an ambitious project to develo...
Large-neighbourhood search (LNS) heuristics are important mathematical programming techniques that s...
We discuss formulations of integer programs with a huge number of variables and their solution by co...
Commercial MIP solvers have made a lot of progress in the last decade. Impressive speed-up factors h...
International audienceIn the the bin packing problem with conflicts, one has to pack items in the mi...
Introduction Exact methods used to solve difficult Combinatorial Optimization problems belong to a ...
Branch-and-bound (B&B) algorithms, and extensions such as branch-and-price (B&P) are powerful tools ...
The multilevel generalized assignment problem (MGAP) is a variation of the generalized assignment pr...
There appear to be two versions of the Dual Bin Packing problem in the literature. In addition, one ...
We show how to extend the integer programming (IP) approach to score-based causal discovery by inclu...
International audienceWe consider the three-stage two-dimensional bin packing problem (2BP) which oc...
We present two efficient branch and price algorithms to solve the maximum cardinality and the dual b...
International audienceThe G12 project is developing a software environment for stating and solving c...
The G12 project is developing a software environment for stating and solving combinatorial problems ...
International audienceThe G12 project is developing a software environment for stating and solving c...
The G12 project recently started by National IGT Australia (NICTA) is an ambitious project to develo...
Large-neighbourhood search (LNS) heuristics are important mathematical programming techniques that s...
We discuss formulations of integer programs with a huge number of variables and their solution by co...
Commercial MIP solvers have made a lot of progress in the last decade. Impressive speed-up factors h...
International audienceIn the the bin packing problem with conflicts, one has to pack items in the mi...
Introduction Exact methods used to solve difficult Combinatorial Optimization problems belong to a ...
Branch-and-bound (B&B) algorithms, and extensions such as branch-and-price (B&P) are powerful tools ...
The multilevel generalized assignment problem (MGAP) is a variation of the generalized assignment pr...
There appear to be two versions of the Dual Bin Packing problem in the literature. In addition, one ...
We show how to extend the integer programming (IP) approach to score-based causal discovery by inclu...
International audienceWe consider the three-stage two-dimensional bin packing problem (2BP) which oc...
We present two efficient branch and price algorithms to solve the maximum cardinality and the dual b...