Pages that link to "Item:Q4277510"
From MaRDI portal
The following pages link to Generating Fenchel Cutting Planes for Knapsack Polyhedra (Q4277510):
Displayed 24 items.
- An implementation of exact knapsack separation (Q330511) (← links)
- Stage- and scenario-wise Fenchel decomposition for stochastic mixed 0-1 programs with special structure (Q337541) (← links)
- Knapsack polytopes: a survey (Q827125) (← links)
- Computing deep facet-defining disjunctive cuts for mixed-integer programming (Q847850) (← links)
- A computational study of exact knapsack separation for the generalized assignment problem (Q967219) (← links)
- Cutting planes for mixed-integer knapsack polyhedra (Q1290620) (← links)
- Solving \(0/1\) integer programs with enumeration cutting planes (Q1339119) (← links)
- An improved cut-and-solve algorithm for the single-source capacitated facility location problem (Q1742898) (← links)
- A cut-and-solve based algorithm for the single-source capacitated facility location problem (Q1926885) (← links)
- Fenchel decomposition for stochastic mixed-integer programming (Q1937960) (← links)
- Solving linear programming relaxations associated with Lagrangean relaxations by Fenchel cutting planes (Q1972019) (← links)
- An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron (Q2052386) (← links)
- Directed fixed charge multicommodity network design: a cutting plane approach using polar duality (Q2077967) (← links)
- A cutting plane method for knapsack polytope (Q2391714) (← links)
- Local cuts for mixed-integer programming (Q2392934) (← links)
- Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem (Q2462108) (← links)
- A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes (Q2481606) (← links)
- The strength of multi-row models (Q2516350) (← links)
- Separation algorithms for 0-1 knapsack polytopes (Q2638369) (← links)
- Lifting the knapsack cover inequalities for the knapsack polytope (Q2661529) (← links)
- Integer set reduction for stochastic mixed-integer programming (Q2701423) (← links)
- Computational Testing of a Separation Procedure for the Knapsack Set with a Single Continuous Variable (Q2815436) (← links)
- Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem (Q2892153) (← links)
- Mathematical Models and Search Algorithms for the Capacitated <i>p</i>-Center Problem (Q3386776) (← links)