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

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

Cited In (47)

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