Pages that link to "Item:Q3703585"
From MaRDI portal
The following pages link to Technical Note—On Generating Cutting Planes from Combinatorial Disjunctions (Q3703585):
Displaying 11 items.
- Reflections on generating (disjunctive) cuts (Q458126) (← links)
- An extreme-point-ranking algorithm for the extreme-point mathematical programming problem (Q580171) (← links)
- A finite cutting plane method for solving linear programs with an additional reverse convex constraint (Q910336) (← links)
- Extensions of a theorem of Balas (Q1075945) (← links)
- A finite procedure to generate feasible points for the extreme point mathematical programming problem (Q1103529) (← links)
- An algorithm for disjunctive programs (Q1173796) (← links)
- Strong valid inequalities for fluence map optimization problem under dose-volume restrictions (Q1761858) (← links)
- Cutting planes from two-term disjunctions (Q2450685) (← links)
- Strong valid inequalities for orthogonal disjunctions and bilinear covering sets (Q2638385) (← links)
- (Q4537754) (← links)
- On disjunctive cuts for combinatorial optimization (Q5952319) (← links)