Pages that link to "Item:Q817174"
From MaRDI portal
The following pages link to Cover and pack inequalities for (mixed) integer programming (Q817174):
Displayed 27 items.
- Using cuts for mixed integer knapsack sets to generate cuts for mixed integer polyhedral conic sets (Q312703) (← links)
- On the transportation problem with market choice (Q479018) (← links)
- The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs (Q708779) (← links)
- Knapsack polytopes: a survey (Q827125) (← links)
- On the complexity of sequentially lifting cover inequalities for the knapsack polytope (Q829120) (← links)
- Convex hulls of superincreasing knapsacks and lexicographic orderings (Q908302) (← links)
- Mingling: mixed-integer rounding with bounds (Q964180) (← links)
- The submodular knapsack polytope (Q1040079) (← links)
- Supermodular covering knapsack polytope (Q1751131) (← links)
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (Q1751150) (← links)
- Facets for continuous multi-mixing set with general coefficients and bounded integer variables (Q1751241) (← links)
- On the complexity of separation from the knapsack polytope (Q2164691) (← links)
- On lifted cover inequalities: a new lifting procedure with unusual properties (Q2294273) (← links)
- New valid inequalities for the fixed-charge and single-node flow polytopes (Q2294335) (← links)
- Parametric convex quadratic relaxation of the quadratic knapsack problem (Q2329476) (← links)
- Lifting for mixed integer programs with variable upper bounds (Q2345614) (← links)
- \(n\)-step mingling inequalities: new facets for the mixed-integer knapsack set (Q2429470) (← links)
- Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem (Q2462108) (← links)
- A resource constrained scheduling problem with multiple independent producers and a single linking constraint: a coal supply chain example (Q2514747) (← links)
- Separation algorithms for 0-1 knapsack polytopes (Q2638369) (← links)
- Lifting the knapsack cover inequalities for the knapsack polytope (Q2661529) (← links)
- A Constraint-Programming-Based Branch-and-Price-and-Cut Approach for Operating Room Planning and Scheduling (Q2830948) (← links)
- Integer programming solution approach for inventory‐production–distribution problems with direct shipments (Q3499436) (← links)
- Lifting for the integer knapsack cover polyhedron (Q6102182) (← links)
- A branch-and-price-and-cut algorithm for operating room scheduling under human resource constraints (Q6164341) (← links)
- New classes of facets for complementarity knapsack problems (Q6166884) (← links)
- Formulations and valid inequalities for the capacitated dispersion problem (Q6179719) (← links)