Pages that link to "Item:Q3565241"
From MaRDI portal
The following pages link to Fifty-Plus Years of Combinatorial Integer Programming (Q3565241):
Displaying 10 items.
- A polyhedral approach to the single row facility layout problem (Q378107) (← links)
- Gap inequalities for non-convex mixed-integer quadratic programs (Q408381) (← links)
- Complexity results for the gap inequalities for the max-cut problem (Q439900) (← links)
- On the complexity of surrogate and group relaxation for integer linear programs (Q2060595) (← links)
- Valid inequalities for mixed-integer programmes with fixed charges on sets of variables (Q2183195) (← links)
- New valid inequalities for the fixed-charge and single-node flow polytopes (Q2294335) (← links)
- A new separation algorithm for the Boolean quadric and cut polytopes (Q2339832) (← links)
- Mixed Integer Linear Programming Formulation Techniques (Q2808240) (← links)
- Graphs and Algorithms in Communication Networks on Seven League Boots (Q3404458) (← links)
- The Boolean Quadric Polytope (Q5050144) (← links)