bc-opt: A branch-and-cut code for mixed integer programs
From MaRDI portal
Recommendations
Cited in
(13)- Classical cuts for mixed-integer programming and branch-and-cut
- On the equivalence of linear complementarity problems
- The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization
- MPC for discrete-event systems with soft and hard synchronization constraints
- A branch-and-bound algorithm for concave network flow problems
- A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems
- Flow pack facets of the single node fixed-charge flow polytope
- scientific article; zbMATH DE number 2084782 (Why is no real title available?)
- Cutting planes in integer and mixed integer programming
- Integrating operations research in constraint programming
- A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
- Integrating operations research in constraint programming
- Problems of discrete optimization: challenges and main approaches to solve them
This page was built for publication: \(bc\)-\(opt\): A branch-and-cut code for mixed integer programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1961983)