Pages that link to "Item:Q1939718"
From MaRDI portal
The following pages link to A simple finite cutting plane algorithm for integer programs (Q1939718):
Displaying 14 items.
- A computational study of the cutting plane tree algorithm for general mixed-integer linear programs (Q433830) (← links)
- An application of the Hermite normal form in integer programming (Q757241) (← links)
- A finitely converging cutting plane technique (Q1060961) (← links)
- A surrogate cutting plane algorithm for all-integer programming (Q1086159) (← links)
- The mixed cutting plane algorithm for all-integer programming (Q1092815) (← links)
- A fully polynomial epsilon approximation cutting plane algorithm for solving combinatorial linear programs containing a sufficiently large ball (Q1376264) (← links)
- Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
- Cutting to the chase. (Q2351157) (← links)
- (Q3035141) (← links)
- A primal-dual cutting-plane algorithm for all-integer programming (Q3320128) (← links)
- Fenchel Cutting Planes for Integer Programs (Q4287599) (← links)
- Computational Integer Programming and Cutting Planes (Q5292084) (← links)
- A disjunctive cutting plane procedure for general mixed-integer linear programs (Q5930736) (← links)
- Scanning integer points with lex-inequalities: a finite cutting plane algorithm for integer programming with linear objective (Q6057717) (← links)