Aggregation and Mixed Integer Rounding to Solve MIPs
From MaRDI portal
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
(83)- Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation
- Foundation-penalty cuts for mixed-integer programs.
- Intersection cuts for single row corner relaxations
- Solving MIPs via scaling-based augmentation
- Another pedagogy for mixed-integer Gomory
- Monoidal cut strengthening and generalized mixed-integer rounding for disjunctions and complementarity constraints
- 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
- Chvatal--Gomory--tier cuts for general integer programs
- Mixed \(n\)-step MIR inequalities: facets for the \(n\)-mixing set
- Optimizing splitter and fiber location in a multilevel optical FTTH network
- A computational analysis of lower bounds for big bucket production planning problems
- 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
- Learn to relax: integrating \(0-1\) integer linear programming with pseudo-Boolean conflict-driven search
- The aggregation closure is polyhedral for packing and covering integer programs
- Valid inequalities for mixed-integer programmes with fixed charges on sets of variables
- Outer-product-free sets for polynomial optimization and oracle-based cuts
- The strength of multi-row aggregation cuts for sign-pattern integer programs
- Structure-driven fix-and-propagate heuristics for mixed integer programming
- New SOCP relaxation and branching rule for bipartite bilinear programs
- Convex hull of two quadratic or a conic quadratic and a quadratic inequality
- Generalized mixed integer rounding inequalities: Facets for infinite group polyhedra
- Local cuts for mixed-integer programming
- \(n\)-step mingling inequalities: new facets for the mixed-integer knapsack set
- Manufacturer's mixed pallet design problem
- Projected Chvátal-Gomory cuts for mixed integer linear programs
- Valid inequalities based on the interpolation procedure
- UMTS radio network evaluation and optimization beyond snapshots
- Description of 2-integer continuous knapsack polyhedra
- A note on the continuous mixing set
- Valid inequalities based on simple mixed-integer sets
- Lifting the knapsack cover inequalities for the knapsack polytope
- A compact formulation of a mixed-integer set
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs
- Lift-and-project cuts for mixed integer convex programs
- On cut-based inequalities for capacitated network design polyhedra
- Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems
- Integer programming solution approach for inventory‐production–distribution problems with direct shipments
- Three enhancements for optimization-based bound tightening
- Progress in computational mixed integer programming -- a look back from the other side of the tipping point
- On the exact separation of mixed integer knapsack cuts
- Branching on general disjunctions
- Relaxations of mixed integer sets from lattice-free polyhedra
- Classical cuts for mixed-integer programming and branch-and-cut
- Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
- Relaxations of mixed integer sets from lattice-free polyhedra
- Intersection cuts for nonlinear integer programming: convexification techniques for structured sets
- Lifting for the integer knapsack cover polyhedron
- Tightening discretization-based MILP models for the pooling problem using upper bounds on bilinear terms
- Safe and Verified Gomory Mixed-Integer Cuts in a Rational Mixed-Integer Program Framework
- A heuristic to generate rank-1 GMI cuts
- On the relative strength of split, triangle and quadrilateral cuts
- An exact algorithm for the 0-1 linear knapsack problem with a single continuous variable
- Generalized coefficient strengthening cuts for mixed integer programming
- Green horizons: sustainable global logistics in dynamic supply chain management
- Benders decomposition for the large-scale probabilistic set covering problem
- Cutting planes in integer and mixed integer programming
- The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs
- Mixing polyhedra with two non divisible coefficients
- Aggregation of bilinear bipartite equality constraints and its application to structural model updating problem
- Enhancing the separation of rank-1 Chvátal-Gomory cuts from knapsack sets
- SCIP: solving constraint integer programs
- 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
- Knapsack polytopes: a survey
- MIR closures of polyhedral sets
- Conic mixed-integer rounding cuts
- Using aggregation to optimize long-term production planning at an underground mine
- Lifting two-integer knapsack inequalities
- A note on the MIR closure
- The mixing-MIR set with divisible capacities
- Lago: a (heuristic) branch and cut algorithm for nonconvex minlps
- On the strength of Gomory mixed-integer cuts as group cuts
- LP-based disaggregation approaches to solving the open pit mining production scheduling problem with block processing selectivity
- Mingling: mixed-integer rounding with bounds
- On the complexity of cutting-plane proofs using split cuts
- Generating facets for finite master cyclic group polyhedra using \(n\)-step mixed integer rounding functions
- Valid inequalities for mixed integer linear programs
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)
