On the structure of linear programs with overlapping cardinality constraints
From MaRDI portal
Publication:2297664
DOI10.1016/j.dam.2019.09.015zbMath1446.90163OpenAlexW2601986810WikidataQ127028937 ScholiaQ127028937MaRDI QIDQ2297664
Tobias Fischer, Marc E. Pfetsch
Publication date: 20 February 2020
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2019.09.015
mixed integer programmingcardinality constraintsbranch-and-cutcomplementarity constraintsflow cover inequalities
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Recent advances in mathematical programming with semi-continuous variables and cardinality constraint
- Branch-and-cut for complementarity-constrained optimization
- SCIP: solving constraint integer programs
- Valid inequalities for mixed 0-1 programs
- Representability in mixed integer programming. I: Characterization results
- NP-completeness of the linear complementarity problem
- Maximal chordal subgraphs
- On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\)
- A generalization of antiwebs to independence systems and their canonical facets
- On the facial structure of the set covering polytope
- Geometric algorithms and combinatorial optimization
- On the set covering polytope: Facets with coefficients in \(\{0,1,2,3\}\)
- On the dimension of projected polyhedra
- Disjunctive programming: Properties of the convex hull of feasible points
- The complementary class of generalized flow cover inequalities
- A polyhedral study of the cardinality constrained knapsack problem
- Facets of the independent set polytope
- Branch-and-cut for linear programs with overlapping SOS1 constraints
- Monoidal cut strengthening and generalized mixed-integer rounding for disjunctions and complementarity constraints
- Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints
- Valid inequalities for 0-1 knapsacks and MIPs with generalised upper bound constraints
- Branch-and-cut for combinatorial optimization problems without auxiliary binary variables
- Optimal Cardinality Constrained Portfolio Selection
- Formulations for dynamic lot sizing with service levels
- Polyhedral Approaches to Mixed Integer Linear Programming
- Generalizations of Cliques, Odd Cycles and Anticycles and Their Relation to Independence System Polyhedra
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- Computational study of a family of mixed-integer quadratic programming problems
- A class of hypergraphs that generalizes chordal graphs
- Mathematical Programs with Cardinality Constraints: Reformulation by Complementarity-Type Conditions and a Regularization Method
- LATIN 2004: Theoretical Informatics
