Aggregation and Mixed Integer Rounding to Solve MIPs
From MaRDI portal
Publication:3635007
DOI10.1287/OPRE.49.3.363.11211zbMATH Open1163.90671MaRDI QIDQ3635007FDOQ3635007
Authors: Hugues Marchand, Laurence A. Wolsey 
Publication date: 3 July 2009
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/c6707839419fb37be4cfb3b5a1d90320786d3a9a
Recommendations
- Rounding and propagation heuristics for mixed integer programming
- A feasible rounding approach for mixed-integer optimization problems
- A rounding algorithm for integer programs
- Aggregation and Disaggregation in Integer Programming Problems
- scientific article; zbMATH DE number 3972639
- Mingling: mixed-integer rounding with bounds
- An aggregate function method for integer programming
- scientific article; zbMATH DE number 3912106
- Mixed integer programming computation
- Recursive central rounding for mixed integer programs
Cited In (79)
- Facets for continuous multi-mixing set with general coefficients and bounded integer variables
- Manufacturer's mixed pallet design problem
- Outer-product-free sets for polynomial optimization and oracle-based cuts
- Local cuts for mixed-integer programming
- Tightening discretization-based MILP models for the pooling problem using upper bounds on bilinear terms
- New SOCP relaxation and branching rule for bipartite bilinear programs
- Safe and Verified Gomory Mixed-Integer Cuts in a Rational Mixed-Integer Program Framework
- Face dimensions of general-purpose cutting planes for mixed-integer linear programs
- The strength of multi-row aggregation cuts for sign-pattern integer programs
- Structure-driven fix-and-propagate heuristics for mixed integer programming
- Learn to relax: integrating \(0-1\) integer linear programming with pseudo-Boolean conflict-driven search
- Valid inequalities for mixed-integer programmes with fixed charges on sets of variables
- The aggregation closure is polyhedral for packing and covering integer programs
- Integer programming solution approach for inventory‐production–distribution problems with direct shipments
- Monoidal cut strengthening and generalized mixed-integer rounding for disjunctions and complementarity constraints
- Generalized coefficient strengthening cuts for mixed integer programming
- Lifting the knapsack cover inequalities for the knapsack polytope
- The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs
- Computational aspects of infeasibility analysis in mixed integer programming
- Lago: a (heuristic) branch and cut algorithm for nonconvex minlps
- Lifting for the integer knapsack cover polyhedron
- Strengthened clique-family inequalities for the stable set polytope
- Lift-and-project cuts for mixed integer convex programs
- Knapsack polytopes: a survey
- A note on the MIR closure
- On the strength of Gomory mixed-integer cuts as group cuts
- Valid inequalities for mixed integer linear programs
- Mixing polyhedra with two non divisible coefficients
- Integer-programming software systems
- A computational analysis of lower bounds for big bucket production planning problems
- The mixing-MIR set with divisible capacities
- Progress in computational mixed integer programming -- a look back from the other side of the tipping point
- Using aggregation to optimize long-term production planning at an underground mine
- Convex hull of two quadratic or a conic quadratic and a quadratic inequality
- Generating facets for finite master cyclic group polyhedra using \(n\)-step mixed integer rounding functions
- Lifting two-integer knapsack inequalities
- Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
- Valid inequalities for a single constrained 0-1 MIP set intersected with a conflict graph
- LP-based disaggregation approaches to solving the open pit mining production scheduling problem with block processing selectivity
- Branching on general disjunctions
- UMTS radio network evaluation and optimization beyond snapshots
- A heuristic to generate rank-1 GMI cuts
- On the relative strength of split, triangle and quadrilateral cuts
- Solving MIPs via scaling-based augmentation
- On the complexity of cutting-plane proofs using split cuts
- Generalized mixed integer rounding inequalities: Facets for infinite group polyhedra
- Cover and pack inequalities for (mixed) integer programming
- Intersection cuts for nonlinear integer programming: convexification techniques for structured sets
- Conic mixed-integer rounding cuts
- Valid inequalities based on the interpolation procedure
- Description of 2-integer continuous knapsack polyhedra
- Mingling: mixed-integer rounding with bounds
- Valid inequalities based on simple mixed-integer sets
- On the exact separation of mixed integer knapsack cuts
- A compact formulation of a mixed-integer set
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs
- SCIP: solving constraint integer programs
- Relaxations of mixed integer sets from lattice-free polyhedra
- Relaxations of mixed integer sets from lattice-free polyhedra
- Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation
- Cutting planes in integer and mixed integer programming
- Another pedagogy for mixed-integer Gomory
- An exact algorithm for the 0-1 linear knapsack problem with a single continuous variable
- MIR closures of polyhedral sets
- Mixed \(n\)-step MIR inequalities: facets for the \(n\)-mixing set
- On the relative strength of different generalizations of split cuts
- Projected Chvátal-Gomory cuts for mixed integer linear programs
- Foundation-penalty cuts for mixed-integer programs.
- Optimizing splitter and fiber location in a multilevel optical FTTH network
- Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems
- Intersection cuts for single row corner relaxations
- A note on the continuous mixing set
- On cut-based inequalities for capacitated network design polyhedra
- Chvatal--Gomory--tier cuts for general integer programs
- \(n\)-step mingling inequalities: new facets for the mixed-integer knapsack set
- Rapid prototyping of optimization algorithms using COIN-OR: a case study involving the cutting-stock problem
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
- Classical cuts for mixed-integer programming and branch-and-cut
- Three enhancements for optimization-based bound tightening
Uses Software
This page was built for publication: Aggregation and Mixed Integer Rounding to Solve MIPs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3635007)
