Pages that link to "Item:Q1424283"
From MaRDI portal
The following pages link to On the facets of the mixed-integer knapsack polyhedron (Q1424283):
Displaying 50 items.
- Continuous knapsack sets with divisible capacities (Q263180) (← links)
- Using cuts for mixed integer knapsack sets to generate cuts for mixed integer polyhedral conic sets (Q312703) (← links)
- DASH: dynamic approach for switching heuristics (Q320816) (← links)
- A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: strong valid inequalities by sequence-independent lifting (Q429687) (← links)
- Approximation algorithms on 0--1 linear knapsack problem with a single continuous variable (Q489742) (← links)
- The worst case analysis of strong knapsack facets (Q517314) (← links)
- On the exact separation of mixed integer knapsack cuts (Q543396) (← links)
- Lifting for conic mixed-integer programming (Q623366) (← links)
- An exact algorithm for the 0-1 linear knapsack problem with a single continuous variable (Q645559) (← links)
- The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs (Q708779) (← links)
- SCIP: solving constraint integer programs (Q734351) (← links)
- Minimal covers, minimal sets and canonical facets of the posynomial knapsack polytope (Q761350) (← links)
- Cover and pack inequalities for (mixed) integer programming (Q817174) (← links)
- Integer-programming software systems (Q817202) (← links)
- Knapsack polytopes: a survey (Q827125) (← links)
- Lifting inequalities: a framework for generating strong cuts for nonlinear programs (Q847822) (← links)
- Lifting two-integer knapsack inequalities (Q868448) (← links)
- On the strength of Gomory mixed-integer cuts as group cuts (Q948966) (← links)
- How tight is the corner relaxation? (Q951100) (← links)
- Mingling: mixed-integer rounding with bounds (Q964180) (← links)
- Valid inequalities for the single-item capacitated lot sizing problem with step-wise costs (Q1026766) (← links)
- The submodular knapsack polytope (Q1040079) (← links)
- Cutting planes for mixed-integer knapsack polyhedra (Q1290620) (← links)
- The 0-1 knapsack problem with a single continuous variable (Q1295954) (← links)
- On facets of knapsack equality polytopes (Q1367796) (← links)
- Cyclic group and knapsack facets (Q1424275) (← links)
- A concise characterization of strong knapsack facets (Q1634771) (← links)
- Binary extended formulations of polyhedral mixed-integer sets (Q1650775) (← links)
- Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
- Valid inequalities for the multi-dimensional multiple-choice 0-1 knapsack problem (Q1751116) (← links)
- Supermodular covering knapsack polytope (Q1751131) (← links)
- Facets for continuous multi-mixing set with general coefficients and bounded integer variables (Q1751241) (← links)
- An \(O(n \log n)\) procedure for identifying facets of the knapsack polytope. (Q1811629) (← links)
- Lifted inequalities for \(0-1\) mixed-integer bilinear covering sets (Q2248758) (← links)
- \(n\)-step mingling inequalities: new facets for the mixed-integer knapsack set (Q2429470) (← links)
- The splittable flow arc set with capacity and minimum load constraints (Q2450712) (← links)
- Polyhedral properties for the intersection of two knapsacks (Q2476986) (← links)
- Description of 2-integer continuous knapsack polyhedra (Q2506817) (← links)
- Computational testing of a separation procedure for the knapsack set with a single continuous variable (Q2815436) (← links)
- Easily Computable Facets of the Knapsack Polytope (Q3032082) (← links)
- On cut-based inequalities for capacitated network design polyhedra (Q3082603) (← links)
- The Integer Knapsack Cover Polyhedron (Q3519194) (← links)
- (Q3840363) (← links)
- (Q4325138) (← links)
- A directed cycle-based column-and-cut generation method for capacitated survivable network design (Q4474304) (← links)
- A Repeated Route-then-Schedule Approach to Coordinated Vehicle Platooning: Algorithms, Valid Inequalities and Computation (Q5106379) (← links)
- Approximate and exact merging of knapsack constraints with cover inequalities (Q5151546) (← links)
- Construction de facettes pour le polytope du sac-à-dos quadratique en 0-1 (Q5479831) (← links)
- Facets of the Complementarity Knapsack Polytope (Q5704071) (← links)
- Lifting convex inequalities for bipartite bilinear programs (Q5918426) (← links)
