A polyhedral study of the semi-continuous knapsack problem
From MaRDI portal
Publication:2434996
DOI10.1007/s10107-012-0566-3zbMath1325.90101OpenAlexW1973479963MaRDI QIDQ2434996
Ming Zhao, Ismael Regis jun. de Farias
Publication date: 3 February 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-012-0566-3
branch and cutdisjunctive programmingmixed-integer programmingpolyhedral combinatoricsunit commitment problemsemi-continuous variables
Applications of mathematical programming (90C90) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Related Items
Cutting planes for the multistage stochastic unit commitment problem ⋮ A Polyhedral Study on Fuel-Constrained Unit Commitment ⋮ Recent advances in mathematical programming with semi-continuous variables and cardinality constraint ⋮ Relaxations of Discrete Sets with Semicontinuous Variables ⋮ New classes of facets for complementarity knapsack problems ⋮ Semi-continuous network flow problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The convex hull of two core capacitated network design problems
- A special ordered set approach for optimizing a discontinuous separable piecewise linear function
- Cutting planes for integer programs with general integer variables
- A polyhedral study of the cardinality constrained knapsack problem
- Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms
- Models for representing piecewise linear cost functions
- Computational study of a family of mixed-integer quadratic programming problems
- Anti-blocking polyhedra
- Mixed integer models for the stationary case of gas network optimization
- Branch-and-cut for combinatorial optimization problems without auxiliary binary variables
- Logic, Optimization, and Constraint Programming
- Large-Scale Portfolio Optimization
- A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization
- Faces for a linear inequality in 0–1 variables
- Facet of regular 0–1 polytopes
- Facets of the knapsack polytope
- The reformulation of two mixed integer programming problems
- THE MULTIPLE-CHOICE KNAPSACK PROBLEM
- Cutting-Planes for Complementarity Constraints
- Technical Note—The Use of Cuts in Complementary Programming
- Blocking and anti-blocking pairs of polyhedra
- Facets of the Complementarity Knapsack Polytope
- Integer Programming and Combinatorial Optimization
- Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
- A generalized assignment problem with special ordered sets: a polyhedral approach.
