Pages that link to "Item:Q2434996"
From MaRDI portal
The following pages link to A polyhedral study of the semi-continuous knapsack problem (Q2434996):
Displaying 11 items.
- Continuous knapsack sets with divisible capacities (Q263180) (← links)
- Cutting planes for the multistage stochastic unit commitment problem (Q291049) (← 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)
- A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: facet-defining inequalities by sequential lifting (Q429688) (← links)
- Sequence independent lifting for mixed knapsack problems with GUB constraints (Q896279) (← links)
- A polyhedral study of the cardinality constrained knapsack problem (Q1404231) (← links)
- Semi-continuous network flow problems (Q2248765) (← links)
- Relaxations of Discrete Sets with Semicontinuous Variables (Q2958364) (← links)
- A Polyhedral Study on Fuel-Constrained Unit Commitment (Q5060802) (← links)
- New classes of facets for complementarity knapsack problems (Q6585265) (← links)