Pages that link to "Item:Q2892331"
From MaRDI portal
The following pages link to Embedding {0, ½}-Cuts in a Branch-and-Cut Framework: A Computational Study (Q2892331):
Displaying 20 items.
- Integer programming techniques for the nurse rostering problem (Q284423) (← links)
- Single-commodity robust network design with finite and hose demand sets (Q291071) (← links)
- SCIP: solving constraint integer programs (Q734351) (← links)
- Branch-and-cut approaches for chance-constrained formulations of reliable network design problems (Q744205) (← links)
- Algorithms to separate \(\{0,\frac{1}{2}\}\)-Chvátal-Gomory cuts (Q834596) (← links)
- Applying mod-\(k\)-cuts for solving linear ordering problems (Q839896) (← links)
- Mixed-integer cuts from cyclic groups (Q868450) (← links)
- Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
- Thinning out Steiner trees: a node-based model for uniform edge costs (Q1699615) (← links)
- A relax-and-cut framework for Gomory mixed-integer cuts (Q1762453) (← links)
- On the exact separation of cover inequalities of maximum-depth (Q2115307) (← links)
- A branch\&cut approach to recharging and refueling infrastructure planning (Q2315636) (← links)
- Coordinated cutting plane generation via multi-objective separation (Q2436641) (← links)
- Filtering AtMostNValue with difference constraints: application to the shift minimisation personnel task scheduling problem (Q2453730) (← links)
- Chance-Constrained Binary Packing Problems (Q2940063) (← links)
- Constraint Integer Programming: A New Approach to Integrate CP and MIP (Q5387617) (← links)
- Virtual private network design over the first Chvátal closure (Q5501875) (← links)
- Lifting for the integer knapsack cover polyhedron (Q6102182) (← links)
- Valid Inequalities and Separation Algorithms for the Set Partitioning Problem (Q6160432) (← links)
- Adaptive cut selection in mixed-integer linear programming (Q6168887) (← links)