On the convex hull of the union of certain polyhedra
From MaRDI portal
Publication:1115345
DOI10.1016/0167-6377(88)90058-2zbMath0663.90061OpenAlexW1963574325MaRDI QIDQ1115345
Publication date: 1988
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(88)90058-2
Related Items
Ideal, non-extended formulations for disjunctive constraints admitting a network representation, Holistic fleet optimization incorporating system design considerations, Relaxations for two-level multi-item lot-sizing problems, Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints, Mixed integer linear programming formulations for probabilistic constraints, Projecting systems of linear inequalities with binary variables, Incremental and encoding formulations for mixed integer programming, On the convex hull of feasible solutions to certain combinatorial problems, On the hardness of computing intersection, union and Minkowski sum of polytopes, Smaller extended formulations for the spanning tree polytope of bounded-genus graphs, Modeling disjunctive constraints with a logarithmic number of binary variables and constraints, Convexity recognition of the union of polyhedra, Extended convex hull, Mixed Integer Linear Programming Formulation Techniques, Small and strong formulations for unions of convex sets from the Cayley embedding, Worst-case analysis of clique MIPs, A global optimization RLT-based approach for solving the hard clustering problem, Between steps: intermediate relaxations between big-M and convex hull formulations, A global optimization RLT-based approach for solving the fuzzy clustering problem
Cites Work
