Progress in computational mixed integer programming -- a look back from the other side of the tipping point

DOI10.1007/s10479-006-0091-yzbMath1213.90011WikidataQ114227582 ScholiaQ114227582MaRDI QIDQ537580

Publication date: 20 May 2011

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-006-0091-y

Mathematics Subject Classification ID

90C11: Mixed integer programming

01A60: History of mathematics in the 20th century

90-03: History of operations research and mathematical programming

Related Items

Using Mixed Integer Programming for Matching in an Observational Study of Kidney Failure After Surgery, Stochastic Cutting Planes for Data-Driven Optimization, A Combinatorial Approach for Small and Strong Formulations of Disjunctive Constraints, On Subadditive Duality for Conic Mixed-integer Programs, Cut-Generating Functions and S-Free Sets, Intersection cuts for nonlinear integer programming: convexification techniques for structured sets, Node selection strategies in interval branch and bound algorithms, Beating the SDP bound for the floor layout problem: a simple combinatorial idea, Branch-and-bound solves random binary IPs in poly\((n)\)-time, Optimization over decision trees: a case study for the design of stable direct-current electricity networks, Average-case complexity of a branch-and-bound algorithm for \textsc{Min Dominating Set}, A branch and bound algorithm for robust binary optimization with budget uncertainty, Development of a heuristic based mixed integer linear programming model for resources allocation during cyberfraud mitigation, Compact ILP formulations for the routing and wavelength assignment problem in the design of optical transport networks with regenerators, A cross-decomposition scheme with integrated primal-dual multi-cuts for two-stage stochastic programming investment planning problems, Practical strategies for generating rank-1 split cuts in mixed-integer linear programming, Boosting the feasibility pump, A note on the split rank of intersection cuts, The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs, On the safety of Gomory cut generators, Progress in presolving for mixed integer programming, Relations between facets of low- and high-dimensional group problems, Optimization methods for petroleum fields development and production systems: a review, Confidence intervals for linear unbiased estimators under constrained dependence, A hybrid approach for biobjective optimization, Using diversification, communication and parallelism to solve mixed-integer linear programs, Domain reduction techniques for global NLP and MINLP optimization, An optimal solution to a three echelon supply chain network with multi-product and multi-period, Preprocessing and cutting planes with conflict graphs, Learn to relax: integrating \(0-1\) integer linear programming with pseudo-Boolean conflict-driven search, An algorithm-independent measure of progress for linear constraint propagation, Linearization and parallelization schemes for convex mixed-integer nonlinear optimization, Optimization-based dispatching policies for open-pit mining, Optimality-based domain reduction for inequality-constrained NLP and MINLP problems, Split cuts from sparse disjunctions, Two-row and two-column mixed-integer presolve using hashing-based pairing methods, Pivot-and-reduce cuts: an approach for improving Gomory mixed-integer cuts, Scheduling of maintenance windows in a mining supply chain rail network, A geometric way to build strong mixed-integer programming formulations, Convex hull of two quadratic or a conic quadratic and a quadratic inequality, Cascading knapsack inequalities: reformulation of a crude oil distribution problem, On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study, Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs, Mixed Integer Linear Programming Formulation Techniques, Algorithms and Software for Convex Mixed Integer Nonlinear Programs, Presolve Reductions in Mixed Integer Programming

Cites Work