Pages that link to "Item:Q4287599"
From MaRDI portal
The following pages link to Fenchel Cutting Planes for Integer Programs (Q4287599):
Displaying 50 items.
- Integer programming techniques for the nurse rostering problem (Q284423) (← links)
- 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)
- Reflections on generating (disjunctive) cuts (Q458126) (← links)
- Compressor scheduling in oil fields. Piecewise-linear formulation, valid inequalities, and computational analysis (Q535673) (← links)
- On the exact separation of mixed integer knapsack cuts (Q543396) (← links)
- On the enumerative nature of Gomory's dual cutting plane method (Q607496) (← links)
- An application of the Hermite normal form in integer programming (Q757241) (← 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)
- A finitely converging cutting plane technique (Q1060961) (← links)
- Fixing variables and generating classical cutting planes when using an interior point branch and cut method to solve integer programming problems (Q1278590) (← links)
- Cutting planes for integer programs with general integer variables (Q1290616) (← links)
- Cutting planes for mixed-integer knapsack polyhedra (Q1290620) (← links)
- Solving \(0/1\) integer programs with enumeration cutting planes (Q1339119) (← links)
- Corner polyhedra and their connection with cutting planes (Q1424273) (← links)
- T-space and cutting planes (Q1424274) (← links)
- Cutting planes from a mixed integer Farkas lemma. (Q1426721) (← links)
- How to extend the concept of convexity cuts to derive deeper cutting planes (Q1567070) (← links)
- Valid inequalities for the multi-dimensional multiple-choice 0-1 knapsack problem (Q1751116) (← links)
- A column generation approach to high school timetabling modeled as a multicommodity flow problem (Q1752250) (← links)
- Strong bounds with cut and column generation for class-teacher timetabling (Q1761917) (← links)
- Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problems (Q1806944) (← 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)
- A simple finite cutting plane algorithm for integer programs (Q1939718) (← links)
- Solving linear programming relaxations associated with Lagrangean relaxations by Fenchel cutting planes (Q1972019) (← links)
- Strong IP formulations need large coefficients (Q2019425) (← 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)
- Decomposition of loosely coupled integer programs: a multiobjective perspective (Q2097645) (← links)
- Design and verify: a new scheme for generating cutting-planes (Q2248750) (← links)
- Strong bounds for resource constrained project scheduling: preprocessing and cutting planes (Q2333144) (← links)
- A cutting plane method for knapsack polytope (Q2391714) (← links)
- Local cuts for mixed-integer programming (Q2392934) (← links)
- A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes (Q2481606) (← links)
- Separation algorithms for 0-1 knapsack polytopes (Q2638369) (← links)
- Integer set reduction for stochastic mixed-integer programming (Q2701423) (← links)
- Selection criteria of export equation on the cutting plane method resolving ILP problems (Q2825014) (← links)
- Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem (Q2892153) (← links)
- Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems (Q2960369) (← links)
- Mathematical Models and Search Algorithms for the Capacitated <i>p</i>-Center Problem (Q3386776) (← links)
- Solving capacitated facility location problems by Fenchel cutting planes (Q4680751) (← links)
- On the Complexity of Inverse Mixed Integer Linear Optimization (Q5013588) (← links)
- Using projected cutting planes in the extended cutting plane method (Q5057972) (← links)
- Computational Integer Programming and Cutting Planes (Q5292084) (← links)
- Branch and cut methods for network optimization (Q5936762) (← links)
- Network revenue management game in the railway industry: Stackelberg equilibrium, global optimality, and mechanism design (Q6069228) (← links)
- A solution algorithm for chance-constrained problems with integer second-stage recourse decisions (Q6126651) (← links)
