Classical cuts for mixed-integer programming and branch-and-cut
From MaRDI portal
Publication:5896802
Recommendations
- Classical cuts for mixed-integer programming and branch-and-cut
- scientific article; zbMATH DE number 1488891
- An optimality cut for mixed integer linear programs
- Cuts for Conic Mixed-Integer Programming
- scientific article; zbMATH DE number 2084777
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization
- A cutting plane theory for mixed integer optimization
- Disjunctive cuts for mixed integer nonlinear programming problems
- A branch-and-cut algorithm for mixed-integer bilinear programming
- On t-branch split cuts for mixed-integer programs
Cites work
- scientific article; zbMATH DE number 3908160 (Why is no real title available?)
- scientific article; zbMATH DE number 1187156 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 3495856 (Why is no real title available?)
- scientific article; zbMATH DE number 3501240 (Why is no real title available?)
- scientific article; zbMATH DE number 3619917 (Why is no real title available?)
- scientific article; zbMATH DE number 1312984 (Why is no real title available?)
- scientific article; zbMATH DE number 780782 (Why is no real title available?)
- scientific article; zbMATH DE number 3211377 (Why is no real title available?)
- scientific article; zbMATH DE number 3410784 (Why is no real title available?)
- (1,k)-configurations and facets for packing problems
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- A Cutting Plane Algorithm for the Linear Ordering Problem
- A New Foundation for a Simplified Primal Integer Programming Algorithm
- A Simplified Primal (All-Integer) Integer Programming Algorithm
- A Strong Cutting Plane Algorithm for Production Scheduling with Changeover Costs
- A cutting plane algorithm for minimum perfect 2-matchings
- Aggregation and Mixed Integer Rounding to Solve MIPs
- An Automatic Method of Solving Discrete Programming Problems
- An Improved Implicit Enumeration Approach for Integer Programming
- An Introduction to the Theory of Cutting-Planes
- Computer Codes for Problems of Integer Programming
- Covering, Packing and Knapsack Problems
- Cutting planes for integer programs with general integer variables
- Cutting planes in integer and mixed integer programming
- Enumerative Methods in Integer Programming
- Facets and algorithms for capacitated lot sizing
- Facets of the knapsack polytope
- Geometric algorithms and combinatorial optimization
- Gomory cuts revisited
- Hypercylindrically Deduced Cuts in Zero-One Integer Programs
- Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut
- Integer Linear Programming: A Study in Computational Efficiency
- Integer Programming Algorithms: A Framework and State-of-the-Art Survey
- Integer Programming and Pricing
- Intersection Cuts—A New Type of Cutting Planes for Integer Programming
- Letter to the Editor—Computational Results of an Integer Programming Algorithm
- Linear optimization and extensions.
- Location, scheduling, design and integer programming
- Lot-size models with backlogging: Strong reformulations and cutting planes
- MIP: Theory and practice -- closing the gap
- Minimizing Drum Latency Time
- Odd Minimum Cut-Sets and b-Matchings
- On the Solution of Discrete Programming Problems
- On the Uncapacitated Plant Location Problem. I: Valid Inequalities and Facets
- On the Uncapacitated Plant Location Problem. II: Facets and Lifting Theorems
- On the existence of optimal solutions to integer and mixed-integer programming problems
- On the facial structure of set packing polyhedra
- On the solution of traveling salesman problems
- On the symmetric travelling salesman problem I: Inequalities
- Optimization of a 532-city symmetric traveling salesman problem by branch and cut
- Outline of an algorithm for integer solutions to linear programs
- Préfermeture sur un ensemble ordonné
- Solving Airline Crew Scheduling Problems by Branch-and-Cut
- Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
- Solving Large-Scale Zero-One Linear Programming Problems
- Solving Mixed Integer Programming Problems Using Automatic Reformulation
- Strong Formulations for Multi-Item Capacitated Lot Sizing
- Strong formulations for mixed integer programming: A survey
- Technical Note—A Note on Zero-One Programming
- Technical Note—Facets and Strong Valid Inequalities for Integer Programs
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- Trees and Cuts
- Using cutting planes to solve the symmetric Travelling Salesman problem
- Valid Linear Inequalities for Fixed Charge Problems
- Valid inequalities and facets of the capacitated plant location problem
- Valid inequalities and separation for capacitated economic lot sizing
- \(bc\)-\(opt\): A branch-and-cut code for mixed integer programs
Cited in
(14)- Classical cuts for mixed-integer programming and branch-and-cut
- Optimizing a linear fractional function over the integer efficient set
- Polyhedral approaches to mixed integer linear programming
- An optimality cut for mixed integer linear programs
- Spherical cuts for integer programming problems
- Valid inequalities for mixed integer linear programs
- On degenerate multi-row Gomory cuts
- \(bc\)-\(opt\): A branch-and-cut code for mixed integer programs
- On t-branch split cuts for mixed-integer programs
- On interval-subgradient and no-good cuts
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II
- Foundation-penalty cuts for mixed-integer programs.
- scientific article; zbMATH DE number 2084777 (Why is no real title available?)
- Cutting Planes from the Branch-and-Bound Tree: Challenges and Opportunities
This page was built for publication: Classical cuts for mixed-integer programming and branch-and-cut
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5896802)
