Progress in computational mixed integer programming -- a look back from the other side of the tipping point
From MaRDI portal
(Redirected from Publication:537580)
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 inequalities and separation for uncapacitated fixed charge networks
- Valid Linear Inequalities for Fixed Charge Problems
Cited in
(52)- 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
- Compact ILP formulations for the routing and wavelength assignment problem in the design of optical transport networks with regenerators
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs
- A cross-decomposition scheme with integrated primal-dual multi-cuts for two-stage stochastic programming investment planning problems
- Presolve Reductions in Mixed Integer Programming
- 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
- Boosting the feasibility pump
- 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
- Beating the SDP bound for the floor layout problem: a simple combinatorial idea
- Intersection cuts for nonlinear integer programming: convexification techniques for structured sets
- Node selection strategies in interval branch and bound algorithms
- 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
- A note on the split rank of intersection cuts
- Certified Core-Guided MaxSAT Solving
- Solving continuous and discrete nonlinear programs with BARON
- A combined linear and nonlinear presolve for nonlinear optimization
- LLMs for cold-start cutting plane separator configuration
- Last fifty years of integer linear programming: a focus on recent practical advances
- Node selection through upper bounding local search methods in branch \& bound solvers for NCOPs
- 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
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)
