Pages that link to "Item:Q4427368"
From MaRDI portal
The following pages link to Lifted Cover Inequalities for 0-1 Integer Programs: Complexity (Q4427368):
Displaying 26 items.
- A branch-cut-and-price algorithm for the piecewise linear transportation problem (Q319653) (← links)
- Yet harder knapsack problems (Q653327) (← links)
- Cover and pack inequalities for (mixed) integer programming (Q817174) (← links)
- Knapsack polytopes: a survey (Q827125) (← links)
- On the complexity of sequentially lifting cover inequalities for the knapsack polytope (Q829120) (← links)
- Cutting plane algorithms for \(0-1\) programming based on cardinality cuts (Q976440) (← links)
- The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design (Q1616826) (← links)
- An effective hybrid approach to the two-stage capacitated facility location problem (Q1713740) (← links)
- A cut-and-solve based algorithm for the single-source capacitated facility location problem (Q1926885) (← links)
- A combinatorial cut-and-lift procedure with an application to 0-1 second-order conic programming (Q2097632) (← links)
- A new class of hard problem instances for the 0-1 knapsack problem (Q2140267) (← links)
- On the complexity of separation from the knapsack polytope (Q2164691) (← links)
- Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem (Q2462108) (← links)
- Simple lifted cover inequalities and hard knapsack problems (Q2581317) (← links)
- Separation algorithms for 0-1 knapsack polytopes (Q2638369) (← links)
- Multi-cover inequalities for totally-ordered multiple knapsack sets: theory and computation (Q2689829) (← links)
- Risk-Averse Shortest Path Interdiction (Q2830955) (← links)
- Cover inequalities for robust knapsack sets-Application to the robust bandwidth packing problem (Q2892146) (← links)
- Chance-Constrained Binary Packing Problems (Q2940063) (← links)
- On the minimum cost multiple-source unsplittable flow problem (Q3004201) (← links)
- Optimal Network Design with End-to-End Service Requirements (Q4604906) (← links)
- Sequence independent lifting of cover inequalities (Q5101436) (← links)
- A Repeated Route-then-Schedule Approach to Coordinated Vehicle Platooning: Algorithms, Valid Inequalities and Computation (Q5106379) (← links)
- Scheduling of waterways with tide and passing box (Q6051583) (← links)
- Features for the 0-1 knapsack problem based on inclusionwise maximal solutions (Q6168585) (← links)
- Safe and Verified Gomory Mixed-Integer Cuts in a Rational Mixed-Integer Program Framework (Q6202766) (← links)
