Pages that link to "Item:Q1366300"
From MaRDI portal
The following pages link to Generating cuts from surrogate constraint analysis for zero-one and multiple choice programming (Q1366300):
Displayed 13 items.
- Surrogate-RLT cuts for zero-one integer programs (Q330260) (← links)
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects (Q817185) (← links)
- Knapsack polytopes: a survey (Q827125) (← links)
- A branch and cut algorithm for resource-constrained project scheduling problem subject to nonrenewable resources with pre-scheduled procurement (Q900590) (← links)
- Decomposition schemes and acceleration techniques in application to production-assembly-distribution system design (Q925847) (← links)
- Second-order cover inequalities (Q927162) (← links)
- Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities (Q951101) (← links)
- Foundation-penalty cuts for mixed-integer programs. (Q1413909) (← links)
- Valid inequalities for the multi-dimensional multiple-choice 0-1 knapsack problem (Q1751116) (← links)
- Partial convexification cuts for 0--1 mixed-integer programs (Q1771349) (← links)
- Chvatal--Gomory--tier cuts for general integer programs (Q1779688) (← links)
- Solving linear programming relaxations associated with Lagrangean relaxations by Fenchel cutting planes (Q1972019) (← links)
- A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem (Q2462106) (← links)