The following pages link to bc-opt (Q32993):
Displaying 12 items.
- Cutting planes in integer and mixed integer programming (Q697578) (← links)
- On the equivalence of linear complementarity problems (Q1866003) (← links)
- \(bc\)-\(opt\): A branch-and-cut code for mixed integer programs (Q1961983) (← links)
- Problems of discrete optimization: challenges and main approaches to solve them (Q2371716) (← 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)
- Solving Multi-Item Lot-Sizing Problems with an MIP Solver Using Classification and Reformulation (Q3114820) (← 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)
- The uncapacitated lot-sizing problem with sales and safety stocks (Q5930740) (← links)
- Flow pack facets of the single node fixed-charge flow polytope (Q5952067) (← links)
