Primal Heuristics for Branch-and-Price Algorithms
From MaRDI portal
Recommendations
- Primal Heuristics for Branch and Price: The Assets of Diving Methods
- Heuristics of the branch-cut-and-price-framework SCIP
- A Branch-and-Price Algorithm for the Generalized Assignment Problem
- Branch-and-Price Guided Search
- Branch-and-cut-and-price algorithms for the preemptive RCPSP
- Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem
- Cutting planes for branch-and-price algorithms
- A Branch-and-Price Algorithm for the Multiple Knapsack Problem
- A branch-and-price algorithm for a targeting problem
Cites work
- A Primer in Column Generation
- An evolutionary algorithm for polishing mixed integer programming solutions
- Column generation based primal heuristics
- Decomposition Principle for Linear Programs
- MIPLIB 2003
- Partial convexification of general mips by Dantzig-Wolfe reformulation
- SCIP: solving constraint integer programs
- The feasibility pump
Cited in
(8)- Column generation based primal heuristics
- Branch-and-Price Guided Search
- Integral Column Generation for Set Partitioning Problems with Side Constraints
- Primal Heuristics for Branch and Price: The Assets of Diving Methods
- Heuristics of the branch-cut-and-price-framework SCIP
- Integer programming column generation: accelerating branch-and-price using a novel pricing scheme for finding high-quality solutions in set covering, packing, and partitioning problems
- Last fifty years of integer linear programming: a focus on recent practical advances
- A hybrid primal heuristic for solving an integrated patient case-mix planning problem
This page was built for publication: Primal Heuristics for Branch-and-Price Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5176283)