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

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

Cites work

Aggregation and Mixed Integer Rounding to Solve MIPs
Conflict graphs in solving integer programming problems
Degree-two Inequalities, Clique Facets, and Biperfect Graphs
Disjunctive Programming
Gomory cuts revisited
Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut
Integer Programming and Pricing
Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs
MIP: Theory and practice -- closing the gap
On the \(0/1\) knapsack polytope
Solving Large-Scale Zero-One Linear Programming Problems
Valid Linear Inequalities for Fixed Charge Problems
Valid inequalities and separation for uncapacitated fixed charge networks

Cited in

(47)

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

This page was built for publication: Progress in computational mixed integer programming -- a look back from the other side of the tipping point

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q537580)