Pages that link to "Item:Q1813832"
From MaRDI portal
The following pages link to A recursive procedure to generate all cuts for 0-1 mixed integer programs (Q1813832):
Displaying 50 items.
- Characterization of the split closure via geometric lifting (Q319191) (← links)
- Practical strategies for generating rank-1 split cuts in mixed-integer linear programming (Q384805) (← links)
- How tight is the corner relaxation? Insights gained from the stable set problem (Q448970) (← links)
- Revenue models and policies for the car rental industry (Q483214) (← links)
- Three enhancements for optimization-based bound tightening (Q522269) (← links)
- Hooked on IP (Q537605) (← links)
- On the exact separation of mixed integer knapsack cuts (Q543396) (← links)
- DRL\(^*\): A hierarchy of strong block-decomposable linear relaxations for 0-1 mips (Q608295) (← links)
- On the relative strength of split, triangle and quadrilateral cuts (Q623365) (← links)
- A note on the MIR closure and basic relaxations of polyhedra (Q635512) (← links)
- A note on the split rank of intersection cuts (Q647399) (← links)
- Cutting planes in integer and mixed integer programming (Q697578) (← links)
- Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra (Q715090) (← links)
- Testing cut generators for mixed-integer linear programming (Q734353) (← links)
- Cover and pack inequalities for (mixed) integer programming (Q817174) (← links)
- Integer-programming software systems (Q817202) (← links)
- MIR closures of polyhedral sets (Q847821) (← links)
- Lifting inequalities: a framework for generating strong cuts for nonlinear programs (Q847822) (← links)
- Conic mixed-integer rounding cuts (Q847842) (← links)
- \(n\)-step cycle inequalities: facets for continuous multi-mixing set and strong cuts for multi-module capacitated lot-sizing problem (Q896282) (← links)
- Chvátal closures for mixed integer programming problems (Q922950) (← links)
- A note on the MIR closure (Q924876) (← links)
- The mixing-MIR set with divisible capacities (Q930344) (← links)
- Partition inequalities for capacitated survivable network design based on directed \(p\)-cycles (Q951116) (← links)
- Mingling: mixed-integer rounding with bounds (Q964180) (← links)
- On the complexity of cutting-plane proofs using split cuts (Q969513) (← 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)
- Cutting planes for integer programs with general integer variables (Q1290616) (← links)
- Intersection cuts for single row corner relaxations (Q1621696) (← links)
- Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
- Another pedagogy for mixed-integer Gomory (Q1688937) (← links)
- Lift-and-project cuts for convex mixed integer nonlinear programs (Q1697971) (← links)
- Facets for single module and multi-module capacitated lot-sizing problems without backlogging (Q1727732) (← 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)
- Some cut-generating functions for second-order conic sets (Q1751217) (← links)
- Facets for continuous multi-mixing set with general coefficients and bounded integer variables (Q1751241) (← links)
- Split closure and intersection cuts (Q1774172) (← links)
- Chvatal--Gomory--tier cuts for general integer programs (Q1779688) (← links)
- Split cuts and extended formulations for mixed integer conic quadratic programming (Q1785310) (← links)
- A recursive procedure to generate all cuts for 0-1 mixed integer programs (Q1813832) (← links)
- Mixed \(n\)-step MIR inequalities: facets for the \(n\)-mixing set (Q1926486) (← links)
- The rank of (mixed-) integer polyhedra (Q1942280) (← links)
- A simulation-based decomposition approach for two-stage staffing optimization in call centers under arrival rate uncertainty (Q2030341) (← links)
- Strengthened clique-family inequalities for the stable set polytope (Q2060608) (← links)
- Computational aspects of infeasibility analysis in mixed integer programming (Q2063195) (← links)
- The aggregation closure is polyhedral for packing and covering integer programs (Q2089800) (← links)
- On generalized surrogate duality in mixed-integer nonlinear programming (Q2118119) (← links)
- On the facet defining inequalities of the mixed-integer bilinear covering set (Q2216198) (← links)
