A Polytope for a Product of Real Linear Functions in 0/1 Variables

DOI10.1007/978-1-4614-1927-3_18zbMath1242.90111OpenAlexW152596912MaRDI QIDQ2897309

Jon Lee, Oktay Günlük, Janny M. Y. Leung

Publication date: 10 July 2012

Published in: Mixed Integer Nonlinear Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4614-1927-3_18

zbMATH Keywords

productpolytopeinteger nonlinear programming

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items

A Polytope for a Product of Real Linear Functions in 0/1 Variables, Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2, The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints, Relaxations and discretizations for the pooling problem, A binarisation heuristic for non-convex quadratic programming with box constraints, Convexification of bilinear forms through non-symmetric lifting

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A half-product based approximation scheme for agreeably weighted completion time variance
• The perfectly matchable subgraph polytope of an arbitrary graph
• Corrigendum to our paper The ellipsoid method and its consequences in combinatorial optimization
• In situ column generation for a cutting-stock problem
• The Boolean quadratic polytope: Some characteristics, facets and relatives
• The ellipsoid method and its consequences in combinatorial optimization
• Correlation polytopes: Their geometry and complexity
• Geometric algorithms and combinatorial optimization.
• Minimization of ordered, symmetric half-products
• Positive half-products and scheduling with controllable processing times
• Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm
• The cut polytope and the Boolean quadric polytope
• Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem
• Minimization of Half-Products
• A Polytope for a Product of Real Linear Functions in 0/1 Variables
• The perfectly matchable subgraph polytope of a bipartite graph
• Maximizing the Product of Two Linear Functions In 0-1 Variables
• Geometry of cuts and metrics
• A polynomial case of unconstrained zero-one quadratic optimization