Pages that link to "Item:Q1257827"
From MaRDI portal
The following pages link to Cutting-plane theory: Algebraic methods (Q1257827):
Displaying 20 items.
- Duality for mixed-integer convex minimization (Q304264) (← links)
- On sublinear inequalities for mixed integer conic programs (Q312706) (← links)
- Alternative group relaxation of integer programming problems (Q794928) (← links)
- Constructive characterizations of the value-function of a mixed-integer program. I (Q798260) (← links)
- A unified approach for price directive decomposition procedures in integer programming (Q1109677) (← links)
- The b-hull of an integer program (Q1151337) (← links)
- L-shaped decomposition of two-stage stochastic programs with integer recourse (Q1290673) (← links)
- A primal dual integer programming algorithm (Q1309813) (← links)
- Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
- A recursive procedure to generate all cuts for 0-1 mixed integer programs (Q1813832) (← links)
- Additively separable duality theory (Q1908637) (← links)
- A closed-form representation of mixed-integer program value functions (Q1914070) (← links)
- A framework for generalized Benders' decomposition and its application to multilevel optimization (Q2097644) (← links)
- Designing flexible loop-based material handling AGV paths with cell-adjacency priorities: an efficient cutting-plane algorithm (Q2283932) (← links)
- Minimal inequalities (Q3879045) (← links)
- Integer programming duality: Price functions and sensitivity analysis (Q3908768) (← links)
- An elementary survey of general duality theory in mathematical programming (Q3921006) (← links)
- The value function of an integer program (Q3941194) (← links)
- On abstract duality in mathematical programming (Q3958298) (← links)
- Continuous cutting plane algorithms in integer programming (Q6047699) (← links)