A polytope for a product of real linear functions in 0/1 variables

DOI10.1007/978-1-4614-1927-3_18zbMATH Open1242.90111OpenAlexW152596912MaRDI QIDQ2897309FDOQ2897309

Authors: Oktay Günlük, Jon Lee, Janny 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

Recommendations

• Linear forms of nonlinear expressions: new insights on old ideas
• Nonlinear 0–1 programming: I. Linearization techniques
• Maximizing the Product of Two Linear Functions In 0-1 Variables
• A linearization method for mixed 0--1 polynomial programs
• Linearization of mixed-integer products

zbMATH Keywords

polytopeproductinteger nonlinear programming

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (7)

• 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
• Convexification of bilinear forms through non-symmetric lifting
• Maximizing the Product of Two Linear Functions In 0-1 Variables
• Relaxations and discretizations for the pooling problem
• A binarisation heuristic for non-convex quadratic programming with box constraints

This page was built for publication: A polytope for a product of real linear functions in 0/1 variables

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2897309)