Last fifty years of integer linear programming: a focus on recent practical advances
From MaRDI portal
benders decompositionbranch-and-cutcombinatorial optimizationDantzig-Wolfe decompositionmixed-integer linear programming
History of mathematics in the 20th century (01A60) History of mathematics in the 21st century (01A61) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) History of operations research and mathematical programming (90-03) Mixed integer programming (90C11) Combinatorial optimization (90C27)
Cites work
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
- \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts
- ``Facet separation with one linear program
- A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- A brief history of linear and mixed-integer programming computation
- A Closest Benders Cut Selection Scheme for Accelerating the Benders Decomposition Algorithm
- A combinatorial flow-based formulation for temporal bin packing problems
- A comparison of Steiner tree relaxations
- A computational comparison of symmetry handling methods for mixed integer programs
- A computational status update for exact rational mixed integer programming
- A computational study of primal heuristics inside an MI(NL)P solver
- A Computational Study of Search Strategies for Mixed Integer Programming
- A criterion space search algorithm for biobjective mixed integer programming: the triangle splitting method
- A feasibility pump heuristic for general mixed-integer problems
- A generic exact solver for vehicle routing and related problems
- A generic view of Dantzig--Wolfe decomposition in mixed integer programming
- A heuristic to generate rank-1 GMI cuts
- A hybrid branch-and-bound approach for exact rational mixed-integer programming
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- A Linear Programming Approach to the Cutting-Stock Problem
- A machine learning-based approximation of strong branching
- A modified lift-and-project procedure
- A new branching strategy for time constrained routing problems with application to backhauling
- A note on the selection of Benders' cuts
- A polynomial-time algorithm, based on Newton's method, for linear programming
- A Primer in Column Generation
- A recursive procedure to generate all cuts for 0-1 mixed integer programs
- A relax-and-cut framework for Gomory mixed-integer cuts
- A scaleable projection-based branch-and-cut algorithm for the \(p\)-center problem
- A study of the Bienstock-Zuckerberg algorithm: applications in mining and resource constrained project scheduling
- A survey on Benders decomposition applied to fixed-charge network design problems
- A survey on bilevel optimization under uncertainty
- A survey on mixed-integer programming techniques in bilevel optimization
- A tailored Benders decomposition approach for last-mile delivery with autonomous robots
- A theoretical and computational analysis of full strong-branching
- A unified exact method for solving different classes of vehicle routing problems
- Accelerated Benders decomposition and local branching for dynamic maximum covering location problems
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- Accelerating the Benders decomposition method: application to stochastic network design problems
- Acceleration of cutting-plane and column generation algorithms: Applications to network design
- Adaptive multicut aggregation for two-stage stochastic linear programs with recourse
- Algorithms for hybrid MILP/CP models for a class of optimization problems
- An abstract model for branching and its application to mixed integer programming
- An adaptive partition-based approach for solving two-stage stochastic programs with fixed recourse
- An analytical comparison of different formulations of the travelling salesman problem
- An Automatic Method of Solving Discrete Programming Problems
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- An evolutionary algorithm for polishing mixed integer programming solutions
- An exact rational mixed-integer programming solver
- An improved primal simplex algorithm for degenerate linear programs
- An interior-point Benders based branch-and-cut algorithm for mixed integer programs
- Arc flow formulations based on dynamic programming: theoretical foundations and applications
- Automatic Dantzig-Wolfe reformulation of mixed integer programs
- Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation
- Backdoor branching
- Benders decomposition for the discrete ordered median problem
- Benders decomposition for very large scale partial set covering and maximal covering location problems
- Benders decomposition without separability: a computational study for capacitated facility location problems
- Bin packing and related problems: general arc-flow formulation with graph compression
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
- Branching in branch-and-price: A generic scheme
- Branching on nonchimerical fractionalities
- Branching rules revisited
- Chvátal closures for mixed integer programming problems
- Column generation for extended formulations
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem
- Comparison of bundle and classical column generation
- Comparison of formulations for the inventory routing problem
- Computational evaluation of cut-strengthening techniques in logic-based Benders' decomposition
- Conflict analysis in mixed integer programming
- Conflict-Driven Heuristics for Mixed Integer Programming
- Constraint Aggregation in Column Generation Models for Resource-Constrained Covering Problems
- Constraint programming and operations research
- Constraint Programming Based Column Generation for Employee Timetabling
- Cutting plane selection with analytic centers and multiregression
- Cutting Planes from the Branch-and-Bound Tree: Challenges and Opportunities
- Cutting planes in integer and mixed integer programming
- DASH: dynamic approach for switching heuristics
- Decision diagrams for optimization
- Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs
- Decomposition methods for the two-stage stochastic Steiner tree problem
- Decomposition Principle for Linear Programs
- Decomposition-Based Approaches for a Class of Two-Stage Robust Binary Optimization Problems
- Disjunctive programming
- Dual-feasible functions for integer programming and combinatorial optimization. Basics, extensions and applications
- Dual-feasible functions for integer programming and combinatorial optimization: algorithms, characterizations, and approximations
- Dual-Optimal Inequalities for Stabilized Column Generation
- Dynamic Aggregation of Set-Partitioning Constraints in Column Generation
- Dynamic constraint aggregation for solving very large-scale airline crew pairing problems
- Edmonds polytopes and a hierarchy of combinatorial problems
- Elementary closures for integer programs.
- Embedding \(\{0, \frac{1}{2}\}\)-cuts in a branch-and-cut framework: a computational study
- Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines
- Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems
- Enhancing Branch-and-Bound for Multiobjective 0-1 Programming
- Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design
- Experiments in mixed-integer linear programming
- Exploiting erraticism in search
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Extended formulations in combinatorial optimization
- Extended formulations via decision diagrams
- Facet identification for the symmetric traveling salesman polytope
- Facets of the stochastic network flow problem
- Faster first-order primal-dual methods for linear programming using restarts and sharpness
- Feasibility jump: an LP-free Lagrangian MIP heuristic
- FiberSCIP—A Shared Memory Parallelization of SCIP
- Fifty-plus years of combinatorial integer programming
- Finitely convergent decomposition algorithms for two-stage stochastic pure integer programs
- Four Good Reasons to Use an Interior Point Solver Within a MIP Solver
- Generalized adaptive partition-based method for two-stage stochastic linear programs with fixed recourse
- Generalized Benders decomposition
- Gomory cuts revisited
- scientific article; zbMATH DE number 3943559 (Why is no real title available?)
- scientific article; zbMATH DE number 2064405 (Why is no real title available?)
- scientific article; zbMATH DE number 1550909 (Why is no real title available?)
- scientific article; zbMATH DE number 795217 (Why is no real title available?)
- Identifying Minimally Infeasible Subsystems of Inequalities
- Implementing automatic benders decomposition in a modern MIP solver
- Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework
- Improved branch-cut-and-price for capacitated vehicle routing
- Improved integral simplex using decomposition for the set partitioning problem
- Inexact Cuts in Benders Decomposition
- Information-based branching schemes for binary linear mixed integer problems
- Integer Programming
- Integer Programming and Combinatorial Optimization
- Interior point stabilization for column generation
- Interpretable clustering: an optimization approach
- Introduction to Stochastic Programming
- Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints
- Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods
- Lagrangian dual decision rules for multistage stochastic mixed-integer programming
- Learning generalized strong branching for set covering, set packing, and 0-1 knapsack problems
- Learning when to use a decomposition
- Lift-and-project for mixed 0-1 programming: recent progress
- Linear programming using limited-precision oracles
- Local branching
- Logic-based Benders decomposition
- Logic-based Benders decomposition with a partial assignment acceleration technique for avionics scheduling
- LP models for bin packing and cutting stock problems
- Machine learning for combinatorial optimization: a methodological tour d'horizon
- Machine Learning–Supported Prediction of Dual Variables for the Cutting Stock Problem with an Application in Stabilized Column Generation
- Matheuristics: survey and synthesis
- Measuring the impact of primal heuristics
- Mixed integer programming computation
- Mixed integer programming: analyzing 12 years of progress
- New classes of fast lower bounds for bin packing problems
- New developments in the primal-dual column generation technique
- New dynamic programming algorithms for the resource constrained elementary shortest path problem
- New exact techniques applied to a class of network flow formulations
- New route relaxation and pricing strategies for the vehicle routing problem
- New stabilization procedures for the cutting stock problem
- New variants of bundle methods
- Numerically safe Gomory mixed-integer cuts
- Numerically safe lower bounds for the capacitated vehicle routing problem
- Nutmeg: a MIP and CP hybrid solver using branch-and-check
- On a generalization of the Chvátal-Gomory closure
- On clustering and interpreting with rules by means of mathematical optimization
- On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm
- On Generating Lagrangian Cuts for Two-Stage Stochastic Integer Programs
- On learning and branching: a survey
- On lifted cover inequalities: a new lifting procedure with unusual properties
- On optimizing over lift-and-project closures
- On the choice of explicit stabilizing terms in column generation
- On the maximum feasible subsystem problem, IISs and IIS-hypergraphs
- On the membership problem for the elementary closure of a polyhedron
- On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts
- On the relative strength of different generalizations of split cuts
- On the safety of Gomory cut generators
- On the separation of disjunctive cuts
- On the separation of split cuts and related inequalities
- Optimizing over the first Chvátal closure
- Optimizing over the split closure
- Orbital branching
- Orbitopal fixing
- Outline of an algorithm for integer solutions to linear programs
- Packing, partitioning, and covering symresacks
- Parallel Machine Scheduling Under Uncertainty: Models and Exact Algorithms
- Parallelizing the dual revised simplex method
- Partitioning procedures for solving mixed-variables programming problems
- Pivot and shift -- a mixed integer programming heuristic
- Planning and Scheduling by Logic-Based Benders Decomposition
- Polyhedral approaches to mixed integer linear programming
- Polyhedral Characterization of Discrete Dynamic Programming
- Polytopes associated with symmetry handling
- Practical enhancements to the Magnanti-Wong method
- Preprocessing and cutting planes with conflict graphs
- Presolve Reductions in Mixed Integer Programming
- Primal Heuristics for Branch and Price: The Assets of Diving Methods
- Primal Heuristics for Branch-and-Price Algorithms
- Progress in computational mixed integer programming -- a look back from the other side of the tipping point
- Progress in mathematical programming solvers from 2001 to 2020
- Progress in presolving for mixed integer programming
- Proximity search for 0--1 mixed-integer convex programming
- Pruning by isomorphism in branch-and-cut
- Quantum annealing versus digital computing. An experimental comparison
- Rational generating functions and integer programming games
- Recursive central rounding for mixed integer programs
- Reformulation and decomposition of integer programs
- Reformulations in mathematical programming: automatic symmetry detection and exploitation
- RENS. The optimal rounding
- Revival of the Gomory cuts in the 1990's
- Rounding and propagation heuristics for mixed integer programming
- Row-reduced column generation for degenerate master problems
- Safe and Verified Gomory Mixed-Integer Cuts in a Rational Mixed-Integer Program Framework
- Separation algorithms for 0-1 knapsack polytopes
- Simultaneous column-and-row generation for large-scale linear programs with column-dependent-rows
- Solution of a Large-Scale Traveling-Salesman Problem
- Solutions diversification in a column generation algorithm
- Solving LP relaxations of large-scale precedence constrained problems
- Solving Real-World Linear Programs: A Decade and More of Progress
- Split closure and intersection cuts
- Stabilized column generation
- Stabilized column generation for the temporal knapsack problem using dual-optimal inequalities
- Stabilizer-based symmetry breaking constraints for mathematical programs
- State-space relaxation procedures for the computation of bounds to routing problems
- Stochastic survivable network design problems: theory and practice
- Strengthened benders cuts for stochastic integer programs with continuous recourse
- Stronger Inference through Implied Literals from Conflicts and Knapsack Covers
- Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems
- Symmetry in integer linear programming
- Symmetry-breaking inequalities for ILP with structured sub-symmetry
- Ten years of feasibility pump, and counting
- The B<scp>oxstep</scp> Method for Large-Scale Optimization
- The Benders decomposition algorithm: a literature review
- The Benders dual decomposition method
- The Continuous-Time Service Network Design Problem
- The Cutting-Plane Method for Solving Convex Programs
- The ellipsoid method and its consequences in combinatorial optimization
- The feasibility pump
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
- The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs
- The quadrant shrinking method: a simple and efficient algorithm for solving tri-objective integer programs
- The sample average approximation method for stochastic discrete optimization
- The transit time constrained fixed charge multi-commodity network design problem
- The volume algorithm: Producing primal solutions with a subgradient method
- Theoretical challenges towards cutting-plane selection
- Theory versus practice in annealing-based quantum computing
- Transferring information across restarts in MIP
- Two-row and two-column mixed-integer presolve using hashing-based pairing methods
- Two-stage linear decision rules for multi-stage stochastic programming
- Using diversification, communication and parallelism to solve mixed-integer linear programs
- Using dual feasible functions to construct fast lower bounds for routing and location problems
- Using the primal-dual interior point algorithm within the branch-price-and-cut method
- Valid inequalities for mixed integer linear programs
- Valid Linear Inequalities for Fixed Charge Problems
This page was built for publication: Last fifty years of integer linear programming: a focus on recent practical advances
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6981416)
