Pages that link to "Item:Q1961983"
From MaRDI portal
The following pages link to \(bc\)-\(opt\): A branch-and-cut code for mixed integer programs (Q1961983):
Displaying 13 items.
- Cutting planes in integer and mixed integer programming (Q697578) (← links)
- Introduction to ABACUS -- a branch-and-cut system (Q1271386) (← links)
- On the equivalence of linear complementarity problems (Q1866003) (← links)
- Problems of discrete optimization: challenges and main approaches to solve them (Q2371716) (← links)
- A branch-and-bound algorithm for concave network flow problems (Q2494473) (← links)
- A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems (Q2503087) (← links)
- A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting (Q2576248) (← links)
- The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization (Q4789079) (← links)
- MPC for discrete-event systems with soft and hard synchronization constraints (Q4800354) (← links)
- Classical cuts for mixed-integer programming and branch-and-cut (Q5896802) (← links)
- Integrating operations research in constraint programming (Q5898341) (← links)
- Integrating operations research in constraint programming (Q5900889) (← links)
- Flow pack facets of the single node fixed-charge flow polytope (Q5952067) (← links)
