Pages that link to "Item:Q3635007"
From MaRDI portal
The following pages link to Aggregation and Mixed Integer Rounding to Solve MIPs (Q3635007):
Displaying 50 items.
- Three enhancements for optimization-based bound tightening (Q522269) (← links)
- Progress in computational mixed integer programming -- a look back from the other side of the tipping point (Q537580) (← links)
- On the exact separation of mixed integer knapsack cuts (Q543396) (← links)
- Branching on general disjunctions (Q543420) (← links)
- A heuristic to generate rank-1 GMI cuts (Q621750) (← links)
- On the relative strength of split, triangle and quadrilateral cuts (Q623365) (← links)
- An exact algorithm for the 0-1 linear knapsack problem with a single continuous variable (Q645559) (← links)
- Generalized coefficient strengthening cuts for mixed integer programming (Q683740) (← links)
- Cutting planes in integer and mixed integer programming (Q697578) (← links)
- The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs (Q708779) (← links)
- Mixing polyhedra with two non divisible coefficients (Q715089) (← links)
- SCIP: solving constraint integer programs (Q734351) (← links)
- Cover and pack inequalities for (mixed) integer programming (Q817174) (← links)
- Rapid prototyping of optimization algorithms using COIN-OR: a case study involving the cutting-stock problem (Q817190) (← links)
- Integer-programming software systems (Q817202) (← links)
- Knapsack polytopes: a survey (Q827125) (← links)
- MIR closures of polyhedral sets (Q847821) (← links)
- Conic mixed-integer rounding cuts (Q847842) (← links)
- Using aggregation to optimize long-term production planning at an underground mine (Q852993) (← links)
- Lifting two-integer knapsack inequalities (Q868448) (← links)
- A note on the MIR closure (Q924876) (← links)
- The mixing-MIR set with divisible capacities (Q930344) (← links)
- Lago: a (heuristic) branch and cut algorithm for nonconvex minlps (Q940828) (← links)
- On the strength of Gomory mixed-integer cuts as group cuts (Q948966) (← links)
- LP-based disaggregation approaches to solving the open pit mining production scheduling problem with block processing selectivity (Q958440) (← links)
- Mingling: mixed-integer rounding with bounds (Q964180) (← links)
- On the complexity of cutting-plane proofs using split cuts (Q969513) (← links)
- Generating facets for finite master cyclic group polyhedra using \(n\)-step mixed integer rounding functions (Q992583) (← links)
- Valid inequalities for mixed integer linear programs (Q995784) (← links)
- Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation (Q1019294) (← links)
- Foundation-penalty cuts for mixed-integer programs. (Q1413909) (← links)
- Intersection cuts for single row corner relaxations (Q1621696) (← links)
- Another pedagogy for mixed-integer Gomory (Q1688937) (← links)
- Monoidal cut strengthening and generalized mixed-integer rounding for disjunctions and complementarity constraints (Q1728353) (← links)
- On the relative strength of different generalizations of split cuts (Q1751106) (← links)
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (Q1751150) (← links)
- Valid inequalities for a single constrained 0-1 MIP set intersected with a conflict graph (Q1751163) (← links)
- Facets for continuous multi-mixing set with general coefficients and bounded integer variables (Q1751241) (← links)
- Chvatal--Gomory--tier cuts for general integer programs (Q1779688) (← links)
- Mixed \(n\)-step MIR inequalities: facets for the \(n\)-mixing set (Q1926486) (← links)
- Optimizing splitter and fiber location in a multilevel optical FTTH network (Q1926952) (← links)
- A computational analysis of lower bounds for big bucket production planning problems (Q1935570) (← links)
- Strengthened clique-family inequalities for the stable set polytope (Q2060608) (← links)
- Face dimensions of general-purpose cutting planes for mixed-integer linear programs (Q2061900) (← links)
- Computational aspects of infeasibility analysis in mixed integer programming (Q2063195) (← links)
- Learn to relax: integrating \(0-1\) integer linear programming with pseudo-Boolean conflict-driven search (Q2074664) (← links)
- The aggregation closure is polyhedral for packing and covering integer programs (Q2089800) (← links)
- Valid inequalities for mixed-integer programmes with fixed charges on sets of variables (Q2183195) (← links)
- Outer-product-free sets for polynomial optimization and oracle-based cuts (Q2196293) (← links)
- The strength of multi-row aggregation cuts for sign-pattern integer programs (Q2294249) (← links)
