Branching in branch-and-price: A generic scheme
From MaRDI portal
Publication:652288
DOI10.1007/s10107-009-0334-1zbMath1229.90100OpenAlexW1999895824MaRDI QIDQ652288
Publication date: 14 December 2011
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-009-0334-1
Related Items
Column Generation based Primal Heuristics, An exact algorithm for an integrated project staffing problem with a homogeneous workforce, Irregular polyomino tiling via integer programming with application in phased array antenna design, All-integer column generation for set partitioning: basic principles and extensions, Column generation approaches for the software clustering problem, Bin packing and cutting stock problems: mathematical models and exact algorithms, Hybrid column generation for large-size covering integer programs: application to transportation planning, Mathematical programming algorithms for bin packing problems with item fragmentation, An exact algorithm for the partition coloring problem, A branch-and-price algorithm for scheduling of deteriorating jobs and flexible periodic maintenance on a single machine, Constraint-specific recovery network for solving airline recovery problems, Exact algorithms for the bin packing problem with fragile objects, Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems, A Branch-and-Price Framework for Decomposing Graphs into Relaxed Cliques, Simultaneously exploiting two formulations: an exact Benders decomposition approach, A Wide Branching Strategy for the Graph Coloring Problem, Decomposition Branching for Mixed Integer Programming, An integer optimality condition for column generation on zero-one linear programs, Bin Packing Problem with Time Lags, A branch-and-price algorithm for the aperiodic multi-period service scheduling problem, Consensus-based Dantzig-Wolfe decomposition, Two extended formulations for the virtual network function placement and routing problem, Exact solution of network flow models with strong relaxations, Dantzig-Wolfe decomposition and branch-and-price solving in G12, Exact approaches for solving a covering problem with capacitated subtrees, Primal Heuristics for Branch and Price: The Assets of Diving Methods, From High-Level Model to Branch-and-Price Solution in G12, Branch-and-price for a multi-attribute technician routing and scheduling problem, An exact column-generation approach for the lot-type design problem, Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning, A new cross decomposition method for stochastic mixed-integer linear programming, Bin packing problem with conflicts and item fragmentation, Solving the Pricing Problem in a Branch-and-Price Algorithm for Graph Coloring Using Zero-Suppressed Binary Decision Diagrams, Exact Solution of Graph Coloring Problems via Constraint Programming and Column Generation, A column generation approach to multiscale capacity planning for power-intensive process networks, Branch-and-price-and-cut algorithms for solving the reliable \(h\)-paths problem, A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems, New exact techniques applied to a class of network flow formulations, On column generation formulations for the RWA problem, A Horizon Decomposition Approach for the Capacitated Lot-Sizing Problem with Setup Times, Combining Dantzig-Wolfe and Benders decompositions to solve a large-scale nuclear outage planning problem, A branch-and-price algorithm for the temporal bin packing problem, Decomposition of loosely coupled integer programs: a multiobjective perspective
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- On compact formulations for integer programs solved by column generation
- Introduction to ABACUS -- a branch-and-cut system
- Exact solution of bin-packing problems using column generation and branch-and-bound
- MINTO, a Mixed INTeger Optimizer
- Branch-and-price algorithms for the one-dimensional cutting stock problem
- Extending Dantzig's bound to the bounded multiple-class binary knapsack problem
- Computational study of a column generation algorithm for bin packing and cutting stock problems
- Comparison of bundle and classical column generation
- Carathéodory bounds for integer cones
- A generic view of Dantzig--Wolfe decomposition in mixed integer programming
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- Computing Partitions with Applications to the Knapsack Problem
- On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm
- Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem
- From High-Level Model to Branch-and-Price Solution in G12
- Implementing Mixed Integer Column Generation
