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