Pages that link to "Item:Q834596"
From MaRDI portal
The following pages link to Algorithms to separate \(\{0,\frac{1}{2}\}\)-Chvátal-Gomory cuts (Q834596):
Displaying 9 items.
- Generalized coefficient strengthening cuts for mixed integer programming (Q683740) (← links)
- Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods (Q1621692) (← links)
- Face dimensions of general-purpose cutting planes for mixed-integer linear programs (Q2061900) (← links)
- Tight compact extended relaxations for nonconvex quadratic programming problems with box constraints (Q2089865) (← links)
- On the exact separation of cover inequalities of maximum-depth (Q2115307) (← links)
- Chvátal-Gomory cuts for the Steiner tree problem (Q2659072) (← links)
- Lifting for the integer knapsack cover polyhedron (Q6102182) (← links)
- Valid Inequalities and Separation Algorithms for the Set Partitioning Problem (Q6160432) (← links)
- Safe and Verified Gomory Mixed-Integer Cuts in a Rational Mixed-Integer Program Framework (Q6202766) (← links)
