Lifted inequalities for 0-1 mixed-integer bilinear covering sets

DOI10.1007/S10107-013-0652-1MaRDI QIDQ2248758zbMATH OpenOpenAlexFDO

Authors Kwanghun Chung, Jean-Philippe Richard, Mohit Tawarmalani

Publication date 27 June 2014

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10107-013-0652-1

Mathematics Subject Classification ID

Quadratic programming (90C20) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonlinear programming (90C30) Mixed integer programming (90C11)

Recommendations

• Lifted flow cover inequalities for mixed 0-1 integer programs
• Facets of a mixed-integer bilinear covering set with bounds on variables
• Sequence independent lifting for mixed integer programs with variable upper bounds
• Sequence independent lifting in mixed integer programming
• On the facet defining inequalities of the mixed-integer bilinear covering set

Cites work

• scientific article; zbMATH DE number 193053 (Why is no real title available?)
• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 914364 (Why is no real title available?)
• A new linearization technique for multi-quadratic 0-1 programming problems.
• Algorithms for network interdiction and fortification games
• An Algorithm for Separable Nonconvex Programming Problems
• An improved linearization strategy for zero-one quadratic programming problems
• Bilinear modeling solution approach for fixed charge network flow problems
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• Disjunctive programming: Properties of the convex hull of feasible points
• Faces for a linear inequality in 0–1 variables
• Facet of regular 0–1 polytopes
• Facets of the knapsack polytope
• Flow pack facets of the single node fixed-charge flow polytope
• Jointly Constrained Biconvex Programming
• Lectures on Polytopes
• Lifted flow cover inequalities for mixed 0-1 integer programs
• Lifted inequalities for \(0-1\) mixed-integer bilinear covering sets
• Lifting inequalities: a framework for generating strong cuts for nonlinear programs
• Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
• On the facets of the mixed-integer knapsack polyhedron
• Sequence independent lifting in mixed integer programming
• Strong valid inequalities for orthogonal disjunctions and bilinear covering sets
• Technical Note—Facets and Strong Valid Inequalities for Integer Programs
• The 0-1 knapsack problem with a single continuous variable
• The Integer Knapsack Cover Polyhedron
• Valid Inequalities and Superadditivity for 0–1 Integer Programs
• Valid Linear Inequalities for Fixed Charge Problems

Cited in

(8)

• On the facet defining inequalities of the mixed-integer bilinear covering set
• Lifting convex inequalities for bipartite bilinear programs
• Lifting convex inequalities for bipartite bilinear programs
• Cutting planes for the multistage stochastic unit commitment problem
• Lifted Cover Inequalities for 0-1 Integer Programs: Complexity
• Lifted flow cover inequalities for mixed 0-1 integer programs
• Lifted inequalities for \(0-1\) mixed-integer bilinear covering sets
• Facets of a mixed-integer bilinear covering set with bounds on variables

Describes a project that uses

Uses Software

• LINGO
• PORTA
• LINDO
• BARON

This page was built for publication: Lifted inequalities for \(0-1\) mixed-integer bilinear covering sets

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