Pages that link to "Item:Q1404231"
From MaRDI portal
The following pages link to A polyhedral study of the cardinality constrained knapsack problem (Q1404231):
Displaying 27 items.
- Implicit cover inequalities (Q266036) (← links)
- The piecewise linear optimization polytope: new inequalities and intersection with semi-continuous constraints (Q378090) (← links)
- Recent advances in mathematical programming with semi-continuous variables and cardinality constraint (Q384213) (← links)
- Cardinality constrained combinatorial optimization: complexity and polyhedra (Q429646) (← links)
- A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: strong valid inequalities by sequence-independent lifting (Q429687) (← links)
- A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: facet-defining inequalities by sequential lifting (Q429688) (← links)
- Optimal rank-sparsity decomposition (Q486401) (← links)
- On a cardinality constrained linear programming knapsack problem (Q753684) (← links)
- Integer-programming software systems (Q817202) (← links)
- Knapsack polytopes: a survey (Q827125) (← links)
- Branch-and-cut for linear programs with overlapping SOS1 constraints (Q1646682) (← links)
- Polyhedral results for a class of cardinality constrained submodular minimization problems (Q1751219) (← links)
- A polyhedral study of nonconvex quadratic programs with box constraints (Q1774169) (← links)
- Optimization algorithms for the disjunctively constrained knapsack problem (Q1797814) (← links)
- Valid inequalities and facets for a hypergraph model of the nonlinear knapsack and the FMS part selection problems (Q1904710) (← links)
- Branch-and-cut for separable piecewise linear optimization and intersection with semi-continuous constraints (Q1947201) (← links)
- Convex optimization under combinatorial sparsity constraints (Q2102824) (← links)
- Subset selection for multiple linear regression via optimization (Q2182858) (← links)
- Semi-continuous network flow problems (Q2248765) (← links)
- A family of inequalities valid for the robust single machine scheduling polyhedron (Q2270446) (← links)
- On the structure of linear programs with overlapping cardinality constraints (Q2297664) (← links)
- On cutting planes for cardinality-constrained linear programs (Q2330656) (← links)
- A polyhedral study of the semi-continuous knapsack problem (Q2434996) (← links)
- (Q4996546) (← links)
- A Combinatorial Approach for Small and Strong Formulations of Disjunctive Constraints (Q5108220) (← links)
- Cardinality minimization, constraints, and regularization: a survey (Q6585278) (← links)
- Relaxations and cutting planes for linear programs with complementarity constraints (Q6607018) (← links)
