Branch, cut, and price: sequential and parallel
From MaRDI portal
(Redirected from Branch, cut, and price: sequential and parallel)
Recommendations
- Parallel branch, cut, and price for large-scale discrete optimization
- Branch-and-price: Column generation for solving huge integer programs
- On distributed solving of the capacitated vehicle routing problem with branch-and-cut algorithms
- Branch-and-cut algorithms for combinatorial optimization and their implementation in ABACUS
- \(bc\)-\(opt\): A branch-and-cut code for mixed integer programs
Cited in
(12)- An approximate dynamic programming approach for the vehicle routing problem with stochastic demands
- Introduction to ABACUS -- a branch-and-cut system
- Parallel branch, cut, and price for large-scale discrete optimization
- Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework
- Combined location and routing problems for drug distribution
- scientific article; zbMATH DE number 2159470 (Why is no real title available?)
- The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization
- Knapsack constraint reformulation: A new approach that significantly reduces the number of sub-problems in the branch and bound algorithm
- A Parallel Macro Partitioning Framework for Solving Mixed Integer Programs
- Branching in branch-and-price: A generic scheme
- Airline crew scheduling: state-of-the-art
- PEBBL: an object-oriented framework for scalable parallel branch and bound
This page was built for publication: Branch, cut, and price: sequential and parallel
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4735940)
