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

DOI10.1007/s10479-006-0091-yzbMath1213.90011OpenAlexW2026514179WikidataQ114227582 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

Mixed integer programming (90C11) History of mathematics in the 20th century (01A60) History of operations research and mathematical programming (90-03)

Related Items

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

Cites Work