Branching in branch-and-price: A generic scheme
From MaRDI portal
Publication:652288
DOI10.1007/S10107-009-0334-1zbMATH Open1229.90100OpenAlexW1999895824MaRDI QIDQ652288FDOQ652288
Authors: F. Vanderbeck 
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
Recommendations
- A Branch-and-Price Algorithm for the Generalized Assignment Problem
- A note on branch-and-cut-and-price
- Branch-and-Price Guided Search
- A branch-and-price algorithm for a targeting problem
- Branch-and-price algorithm for a multicast routing problem
- A Branch-and-Price Algorithm for the Multilevel Generalized Assignment Problem
- scientific article; zbMATH DE number 2084782
- Stabilizing branch-and-price for constrained tree problems
- A branch-and-price approach for the stochastic generalized assignment problem
Cites Work
- Comparison of bundle and classical column generation
- Carathéodory bounds for integer cones
- Branch-and-price: Column generation for solving huge integer programs
- Title not available (Why is that?)
- Implementing Mixed Integer Column Generation
- Exact solution of bin-packing problems using column generation and branch-and-bound
- Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem
- On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm
- Computing Partitions with Applications to the Knapsack Problem
- Computational study of a column generation algorithm for bin packing and cutting stock problems
- A generic view of Dantzig--Wolfe decomposition in mixed integer programming
- Branch-and-price algorithms for the one-dimensional cutting stock problem
- On compact formulations for integer programs solved by column generation
- MINTO, a Mixed INTeger Optimizer
- Introduction to ABACUS -- a branch-and-cut system
- Extending Dantzig's bound to the bounded multiple-class binary knapsack problem
- Title not available (Why is that?)
- From High-Level Model to Branch-and-Price Solution in G12
Cited In (51)
- Enabling research through the SCIP Optimization Suite 8.0
- Decomposition of loosely coupled integer programs: a multiobjective perspective
- Cutting planes for branch-and-price algorithms
- Exact solution of graph coloring problems via constraint programming and column generation
- A Wide Branching Strategy for the Graph Coloring Problem
- Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems
- 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
- A branch-and-price-and-cut method for computing an optimal bramble
- Consensus-based Dantzig-Wolfe decomposition
- All-integer column generation for set partitioning: basic principles and extensions
- An integer optimality condition for column generation on zero-one linear programs
- Branch-and-Price Guided Search
- Column generation approaches for the software clustering problem
- Two extended formulations for the virtual network function placement and routing problem
- Bin Packing Problem with Time Lags
- A horizon decomposition approach for the capacitated lot-sizing problem with setup times
- On column generation formulations for the RWA problem
- A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems
- Branch-and-price-and-cut algorithms for solving the reliable \(h\)-paths problem
- 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
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- Dantzig-Wolfe decomposition and branch-and-price solving in G12
- Effective branching splitting method under cost constraint
- Branch-and-Price Heuristics: A Case Study on the Vehicle Routing Problem with Time Windows
- Simultaneously exploiting two formulations: an exact Benders decomposition approach
- Primal Heuristics for Branch and Price: The Assets of Diving Methods
- New exact techniques applied to a class of network flow formulations
- Hybrid column generation for large-size covering integer programs: application to transportation planning
- A new cross decomposition method for stochastic mixed-integer linear programming
- Title not available (Why is that?)
- Solving the pricing problem in a branch-and-price algorithm for graph coloring using zero-suppressed binary decision diagrams
- Decomposition Branching for Mixed Integer Programming
- From High-Level Model to Branch-and-Price Solution in G12
- Branch-and-price for a multi-attribute technician routing and scheduling problem
- A branch-and-price algorithm for placement routing for a multi-head beam-type component placement tool
- Exact solution of network flow models with strong relaxations
- A column generation approach to multiscale capacity planning for power-intensive process networks
- A Branch-and-Price Framework for Decomposing Graphs into Relaxed Cliques
- Combining Dantzig-Wolfe and Benders decompositions to solve a large-scale nuclear outage planning problem
- Exact algorithms for the bin packing problem with fragile objects
- Constraint-specific recovery network for solving airline recovery problems
- Column generation based primal heuristics
- A branch-and-price algorithm for the temporal bin packing problem
- A branch-and-price algorithm for the aperiodic multi-period service scheduling problem
- Bin packing problem with conflicts and item fragmentation
- Exact approaches for solving a covering problem with capacitated subtrees
- 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
Uses Software
This page was built for publication: Branching in branch-and-price: A generic scheme
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q652288)
