Lifted inequalities for 0-1 mixed-integer bilinear covering sets
DOI10.1007/S10107-013-0652-1zbMATH Open1354.90078OpenAlexW1979024972MaRDI QIDQ2248758FDOQ2248758
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
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
Quadratic programming (90C20) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonlinear programming (90C30) Mixed integer programming (90C11)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Lectures on Polytopes
- Title not available (Why is that?)
- The 0-1 knapsack problem with a single continuous variable
- On the facets of the mixed-integer knapsack polyhedron
- Sequence independent lifting in mixed integer programming
- Faces for a linear inequality in 0–1 variables
- Facet of regular 0–1 polytopes
- Facets of the knapsack polytope
- An Algorithm for Separable Nonconvex Programming Problems
- Title not available (Why is that?)
- Disjunctive programming: Properties of the convex hull of feasible points
- Jointly Constrained Biconvex Programming
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Lifted inequalities for \(0-1\) mixed-integer bilinear covering sets
- Valid Inequalities and Superadditivity for 0–1 Integer Programs
- Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
- Lifting inequalities: a framework for generating strong cuts for nonlinear programs
- Valid Linear Inequalities for Fixed Charge Problems
- Flow pack facets of the single node fixed-charge flow polytope
- An improved linearization strategy for zero-one quadratic programming problems
- Bilinear modeling solution approach for fixed charge network flow problems
- A new linearization technique for multi-quadratic 0-1 programming problems.
- Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs
- Technical Note—Facets and Strong Valid Inequalities for Integer Programs
- Strong valid inequalities for orthogonal disjunctions and bilinear covering sets
- Algorithms for network interdiction and fortification games
- The Integer Knapsack Cover Polyhedron
Cited In (7)
- Lifting convex inequalities for bipartite bilinear programs
- Lifting convex inequalities for bipartite bilinear programs
- Lifted Cover Inequalities for 0-1 Integer Programs: Complexity
- Cutting planes for the multistage stochastic unit commitment problem
- 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
Uses Software
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)
