The following pages link to Gomory cuts revisited (Q2564234):
Displaying 50 items.
- Light on the infinite group relaxation. I: Foundations and taxonomy (Q262442) (← links)
- Integer programming techniques for the nurse rostering problem (Q284423) (← links)
- Individuals, populations and fluid approximations: a Petri net based perspective (Q313335) (← links)
- Characterization of the split closure via geometric lifting (Q319191) (← links)
- Progress in computational mixed integer programming -- a look back from the other side of the tipping point (Q537580) (← links)
- A brief history of lift-and-project (Q537586) (← links)
- Revival of the Gomory cuts in the 1990's (Q537587) (← links)
- A survey of the operational use of ILP models (Q537604) (← links)
- A heuristic to generate rank-1 GMI cuts (Q621750) (← links)
- Lexicography and degeneracy: Can a pure cutting plane algorithm work? (Q647393) (← links)
- A note on the split rank of intersection cuts (Q647399) (← links)
- Cutting planes in integer and mixed integer programming (Q697578) (← links)
- SCIP: solving constraint integer programs (Q734351) (← links)
- On the safety of Gomory cut generators (Q744203) (← links)
- Depth-optimized convexity cuts (Q817181) (← links)
- Integer-programming software systems (Q817202) (← links)
- Airline crew scheduling: state-of-the-art (Q817210) (← links)
- MIR closures of polyhedral sets (Q847821) (← links)
- Mixed-integer cuts from cyclic groups (Q868450) (← links)
- An efficient bound-and-stopped algorithm for integer linear programs on the objective function hyperplane (Q870164) (← links)
- The mixing-MIR set with divisible capacities (Q930344) (← links)
- On the strength of Gomory mixed-integer cuts as group cuts (Q948966) (← links)
- Valid inequalities for mixed integer linear programs (Q995784) (← links)
- Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation (Q1019294) (← links)
- Generating lift-and-project cuts from the LP simplex tableau: open source implementation and testing of new variants (Q1043853) (← links)
- Fixing variables and generating classical cutting planes when using an interior point branch and cut method to solve integer programming problems (Q1278590) (← links)
- A cutting-plane approach to mixed 0-1 stochastic integer programs (Q1278962) (← links)
- Cutting planes for integer programs with general integer variables (Q1290616) (← links)
- ProGen/\(\pi x\) -- An instance generator for resource-constrained project scheduling problems with partially renewable resources and further extensions (Q1578557) (← links)
- Combinatorial optimization: current successes and directions for the future (Q1593834) (← links)
- Intersection cuts for single row corner relaxations (Q1621696) (← links)
- Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
- Fluid approximation of Petri net models with relatively small populations (Q1677193) (← links)
- On the relative strength of different generalizations of split cuts (Q1751106) (← links)
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (Q1751150) (← links)
- A relax-and-cut framework for Gomory mixed-integer cuts (Q1762453) (← links)
- Chvatal--Gomory--tier cuts for general integer programs (Q1779688) (← links)
- Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problems (Q1806944) (← links)
- A generalized Benders decomposition-based branch and cut algorithm for two-stage stochastic programs with nonconvex constraints and mixed-binary first and second stage variables (Q2274882) (← links)
- Pivot-and-reduce cuts: an approach for improving Gomory mixed-integer cuts (Q2275620) (← links)
- A geometric approach to cut-generating functions (Q2349120) (← links)
- Local cuts for mixed-integer programming (Q2392934) (← links)
- Coordinated cutting plane generation via multi-objective separation (Q2436641) (← links)
- Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs (Q2452371) (← links)
- Solving 0-1 programming problems by a penalty approach. (Q2468556) (← links)
- Valid inequalities based on simple mixed-integer sets (Q2583149) (← links)
- Achieving consistency with cutting planes (Q2687054) (← links)
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization (Q2687063) (← links)
- Computational Experiments with Cross and Crooked Cross Cuts (Q2940067) (← links)
- Lift-and-Project Cuts for Mixed Integer Convex Programs (Q3009750) (← links)
