Pages that link to "Item:Q1115345"
From MaRDI portal
The following pages link to On the convex hull of the union of certain polyhedra (Q1115345):
Displayed 19 items.
- Relaxations for two-level multi-item lot-sizing problems (Q403668) (← links)
- Mixed integer linear programming formulations for probabilistic constraints (Q439901) (← links)
- Smaller extended formulations for the spanning tree polytope of bounded-genus graphs (Q527446) (← links)
- Modeling disjunctive constraints with a logarithmic number of binary variables and constraints (Q543399) (← links)
- Projecting systems of linear inequalities with binary variables (Q646699) (← links)
- A global optimization RLT-based approach for solving the fuzzy clustering problem (Q816063) (← links)
- On the hardness of computing intersection, union and Minkowski sum of polytopes (Q958243) (← links)
- On the convex hull of feasible solutions to certain combinatorial problems (Q1198616) (← links)
- Worst-case analysis of clique MIPs (Q2089781) (← links)
- Between steps: intermediate relaxations between big-M and convex hull formulations (Q2117230) (← links)
- Ideal, non-extended formulations for disjunctive constraints admitting a network representation (Q2149570) (← links)
- Small and strong formulations for unions of convex sets from the Cayley embedding (Q2316612) (← links)
- Incremental and encoding formulations for mixed integer programming (Q2450751) (← links)
- A global optimization RLT-based approach for solving the hard clustering problem (Q2576449) (← links)
- Mixed Integer Linear Programming Formulation Techniques (Q2808240) (← links)
- Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints (Q3503848) (← links)
- Convexity recognition of the union of polyhedra (Q5943314) (← links)
- Extended convex hull (Q5952968) (← links)
- Holistic fleet optimization incorporating system design considerations (Q6057031) (← links)