Pages that link to "Item:Q2330656"
From MaRDI portal
The following pages link to On cutting planes for cardinality-constrained linear programs (Q2330656):
Displaying 8 items.
- Cutting plane algorithms for \(0-1\) programming based on cardinality cuts (Q976440) (← links)
- Cardinality constrained and multicriteria (multi)cut problems (Q1013079) (← links)
- Logical constraints as cardinality rules: Tight representation (Q1768603) (← links)
- Convexification techniques for linear complementarity constraints (Q2045009) (← links)
- On the structure of linear programs with overlapping cardinality constraints (Q2297664) (← links)
- On the redundancy of cutting planes for linear complementarity problems (Q3716850) (← links)
- A Note on Bounding a Class of Linear Programming Problems, Including Cutting Stock Problems (Q5202025) (← links)
- Cardinality minimization, constraints, and regularization: a survey (Q6585278) (← links)