On cutting planes for cardinality-constrained linear programs
From MaRDI portal
Publication:2330656
Recommendations
- On the structure of linear programs with overlapping cardinality constraints
- On the Complexity of a Cutting Plane Algorithm for Solving Combinatorial Linear Programs
- Cutting plane algorithms for \(0-1\) programming based on cardinality cuts
- Cutting planes in integer and mixed integer programming
- On disjunctive cuts for combinatorial optimization
Cites work
- scientific article; zbMATH DE number 1234104 (Why is no real title available?)
- scientific article; zbMATH DE number 1266748 (Why is no real title available?)
- scientific article; zbMATH DE number 2065140 (Why is no real title available?)
- scientific article; zbMATH DE number 3804333 (Why is no real title available?)
- scientific article; zbMATH DE number 3215121 (Why is no real title available?)
- A Direct Formulation for Sparse PCA Using Semidefinite Programming
- A family of facets for the uncapacitated \(p\)-median polytope
- A hybrid optimization approach to index tracking
- A note on solving large p-median problems
- A polyhedral study of the cardinality constrained knapsack problem
- A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: facet-defining inequalities by sequential lifting
- A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: strong valid inequalities by sequence-independent lifting
- A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming
- A tree search algorithm for the p-median problem
- Algorithm for cardinality-constrained quadratic optimization
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- An MCDM approach to portfolio optimization.
- An evolutionary heuristic for the index tracking problem.
- Best subset selection via a modern optimization lens
- Branch-and-cut for combinatorial optimisation problems without auxiliary binary variables
- Computational aspects of alternative portfolio selection models in the presence of discrete asset choice constraints
- Computational study of a family of mixed-integer quadratic programming problems
- Convexity Cuts and Cut Search
- Disjunctive Programming
- Ensemble pruning via semi-definite programming
- Foundations of Optimization
- Generalized power method for sparse principal component analysis
- Heuristic algorithms for the portfolio selection problem with minimum transaction lots
- Heuristics for cardinality constrained portfolio optimization
- Intersection Cuts—A New Type of Cutting Planes for Integer Programming
- Lectures on Polytopes
- Lift-and-project for general two-term disjunctions
- On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints
- On the Use of Exact and Heuristic Cutting Plane Methods for the Quadratic Assignment Problem
- On the \(p\)-median polytope
- Simulated annealing for complex portfolio selection problems.
- Some polyhedra related to combinatorial problems
- Technical Note—A Branch-and-Bound Algorithm for Seeking the P-Median
- Technical Note—An Algorithm for the p-Median Problem
- Technical Note—The Use of Cuts in Complementary Programming
Cited in
(12)- Branch-and-cut for complementarity and cardinality constrained linear programs
- Face dimensions of general-purpose cutting planes for mixed-integer linear programs
- Convexification techniques for linear complementarity constraints
- A Note on Bounding a Class of Linear Programming Problems, Including Cutting Stock Problems
- Cardinality minimization, constraints, and regularization: a survey
- On the redundancy of cutting planes for linear complementarity problems
- Cutting plane algorithms for \(0-1\) programming based on cardinality cuts
- On the structure of linear programs with overlapping cardinality constraints
- Logical constraints as cardinality rules: Tight representation
- Cardinality constrained and multicriteria (multi)cut problems
- Cardinality and the Simplex Tableau for the Set Partitioning Problem
- Cardinality Constrained Decomposition
This page was built for publication: On cutting planes for cardinality-constrained linear programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2330656)
