Dantzig-Wolfe decomposition and branch-and-price solving in G12

DOI10.1007/s10601-009-9085-0zbMath1213.90174OpenAlexW2027028514MaRDI QIDQ2430361

Jakob Puchinger, Sebastian Brand, Peter J. Stuckey, Mark G. Wallace

Publication date: 6 April 2011

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-01224910/file/bp_g12.pdf

zbMATH Keywords

modellingcolumn generationbranch and pricehybrid solving

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Linear programming (90C05) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)

Related Items (7)

A data driven Dantzig-Wolfe decomposition framework ⋮ Consensus-based Dantzig-Wolfe decomposition ⋮ Structure Detection in Mixed-Integer Programs ⋮ Partial Convexification of General MIPs by Dantzig-Wolfe Reformulation ⋮ Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework ⋮ Random sampling and machine learning to understand good decompositions ⋮ Automatic Dantzig-Wolfe reformulation of mixed integer programs

Uses Software

• SCIP
• ABACUS
• COMET
• MINTO
• Mercury
• G12
• COIN/BCP
• CUTGEN1

Cites Work

• Unnamed Item
• Branching in branch-and-price: A generic scheme
• On compact formulations for integer programs solved by column generation
• Integrated airline scheduling
• Column generation and the airline crew pairing problem
• CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem
• MINTO, a Mixed INTeger Optimizer
• The volume algorithm: Producing primal solutions with a subgradient method
• A column generation approach to delivery planning over time with inhomogeneous service providers and service interval constraints
• Solving VRPTWs with constraint programming based column generation
• Models and bounds for two-dimensional level packing problems
• Conflict analysis in mixed integer programming
• Models and algorithms for three-stage two-dimensional bin packing
• Mathematical Methods of Organizing and Planning Production
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• An Integrated Solver for Optimization Problems
• A Branch-and-Price Algorithm and New Test Problems for Spectrum Auctions
• Decomposition Principle for Linear Programs
• A Linear Programming Approach to the Cutting-Stock Problem
• Parallel Local Search in Comet
• The execution algorithm of mercury, an efficient purely declarative logic programming language
• The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization
• Column Generation
• Selected Topics in Column Generation
• ACD Term Rewriting
• Logic Programming

This page was built for publication: Dantzig-Wolfe decomposition and branch-and-price solving in G12