Pages that link to "Item:Q2462108"
From MaRDI portal
The following pages link to Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem (Q2462108):
Displaying 23 items.
- Implicit cover inequalities (Q266036) (← links)
- Improving problem reduction for 0-1 multidimensional knapsack problems with valid inequalities (Q342340) (← links)
- Mixed-integer linear optimization for optimal lift-gas allocation with well-separator routing (Q439361) (← links)
- A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem (Q439503) (← links)
- Laminar matroids (Q518194) (← links)
- Knapsack polytopes: a survey (Q827125) (← links)
- Sequence independent lifting for mixed knapsack problems with GUB constraints (Q896279) (← links)
- Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms (Q1424281) (← links)
- Optimization algorithms for the disjunctively constrained knapsack problem (Q1797814) (← links)
- Coupling feasibility pump and large neighborhood search to solve the Steiner team orienteering problem (Q2027061) (← links)
- Revisiting surrogate relaxation for the multidimensional knapsack problem (Q2102833) (← links)
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems (Q2147011) (← links)
- Valid inequalities for mixed-integer programmes with fixed charges on sets of variables (Q2183195) (← links)
- Formulations and algorithms for the recoverable \({\varGamma}\)-robust knapsack problem (Q2329707) (← links)
- Generalized laminar matroids (Q2422233) (← links)
- Separation algorithms for 0-1 knapsack polytopes (Q2638369) (← links)
- CORAL: An Exact Algorithm for the Multidimensional Knapsack Problem (Q2815454) (← links)
- Optimum Solution of the Closest String Problem via Rank Distance (Q2835685) (← links)
- Chance-Constrained Binary Packing Problems (Q2940063) (← links)
- Mathematical Models and Search Algorithms for the Capacitated <i>p</i>-Center Problem (Q3386776) (← links)
- Chance-Constrained Multiple Bin Packing Problem with an Application to Operating Room Planning (Q5084621) (← links)
- Lifting convex inequalities for bipartite bilinear programs (Q5918426) (← links)
- Lifting convex inequalities for bipartite bilinear programs (Q5925639) (← links)
