On the structure of linear programs with overlapping cardinality constraints
DOI10.1016/J.DAM.2019.09.015zbMATH Open1446.90163OpenAlexW2601986810WikidataQ127028937 ScholiaQ127028937MaRDI QIDQ2297664FDOQ2297664
Authors: Tobias Fischer, Marc E. Pfetsch Edit this on Wikidata
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
Recommendations
- Branch-and-cut for complementarity and cardinality constrained linear programs
- Branch-and-cut for linear programs with overlapping SOS1 constraints
- On cutting planes for cardinality-constrained linear programs
- Cardinality constraints and systems of restricted representatives
- A polyhedral study of the cardinality constrained knapsack problem
branch-and-cutcomplementarity constraintsmixed integer programmingcardinality constraintsflow cover inequalities
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Mixed integer programming (90C11)
Cites Work
- SCIP: solving constraint integer programs
- Title not available (Why is that?)
- Geometric algorithms and combinatorial optimization
- A generalization of antiwebs to independence systems and their canonical facets
- Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints
- Disjunctive programming: Properties of the convex hull of feasible points
- Recent advances in mathematical programming with semi-continuous variables and cardinality constraint
- A class of hypergraphs that generalizes chordal graphs
- On the dimension of projected polyhedra
- Maximal chordal subgraphs
- On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\)
- On the facial structure of the set covering polytope
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- Valid inequalities for mixed 0-1 programs
- The complementary class of generalized flow cover inequalities
- NP-completeness of the linear complementarity problem
- Mathematical programs with cardinality constraints: reformulation by complementarity-type conditions and a regularization method
- A polyhedral study of the cardinality constrained knapsack problem
- Branch-and-cut for combinatorial optimisation problems without auxiliary binary variables
- Polyhedral approaches to mixed integer linear programming
- Optimal cardinality constrained portfolio selection
- Representability in mixed integer programming. I: Characterization results
- LATIN 2004: Theoretical Informatics
- Valid inequalities for 0-1 knapsacks and MIPs with generalised upper bound constraints
- Generalizations of Cliques, Odd Cycles and Anticycles and Their Relation to Independence System Polyhedra
- Branch-and-cut for complementarity-constrained optimization
- Branch-and-cut for complementarity and cardinality constrained linear programs
- Branch-and-cut for linear programs with overlapping SOS1 constraints
- Facets of the independent set polytope
- Title not available (Why is that?)
- On the set covering polytope: Facets with coefficients in \(\{0,1,2,3\}\)
- Formulations for dynamic lot sizing with service levels
- Monoidal cut strengthening and generalized mixed-integer rounding for disjunctions and complementarity constraints
- Computational study of a family of mixed-integer quadratic programming problems
Cited In (6)
- Cardinality minimization, constraints, and regularization: a survey
- On cutting planes for cardinality-constrained linear programs
- Branch-and-cut for linear programs with overlapping SOS1 constraints
- On a Reformulation of Mathematical Programs with Cardinality Constraints
- Branch-and-cut for complementarity and cardinality constrained linear programs
- Tight LP-Relaxations of Overlapping Global Cardinality Constraints
Uses Software
This page was built for publication: On the structure of linear programs with overlapping cardinality constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2297664)
