Pages that link to "Item:Q1926486"
From MaRDI portal
The following pages link to Mixed \(n\)-step MIR inequalities: facets for the \(n\)-mixing set (Q1926486):
Displaying 16 items.
- Using cuts for mixed integer knapsack sets to generate cuts for mixed integer polyhedral conic sets (Q312703) (← links)
- On \(n\)-step MIR and partition inequalities for integer knapsack and single-node capacitated flow sets (Q427901) (← links)
- \(n\)-step cycle inequalities: facets for continuous multi-mixing set and strong cuts for multi-module capacitated lot-sizing problem (Q896282) (← links)
- The mixing-MIR set with divisible capacities (Q930344) (← links)
- Mixing MIR inequalities with two divisible coefficients (Q964181) (← links)
- Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
- Facets for single module and multi-module capacitated lot-sizing problems without backlogging (Q1727732) (← links)
- Facets for continuous multi-mixing set with general coefficients and bounded integer variables (Q1751241) (← links)
- Capacitated lot-sizing problem with outsourcing (Q1785408) (← links)
- Generalized mixed integer rounding inequalities: Facets for infinite group polyhedra (Q2390995) (← links)
- \(n\)-step mingling inequalities: new facets for the mixed-integer knapsack set (Q2429470) (← links)
- Valid inequalities based on simple mixed-integer sets (Q2583149) (← links)
- Discrete multi-module capacitated lot-sizing problems with multiple items (Q2670496) (← links)
- Two-step MIR inequalities for mixed integer programs (Q2899057) (← links)
- Lot Sizing with Piecewise Concave Production Costs (Q2940066) (← links)
- Valid inequalities and facets for multi‐module survivable network design problem (Q6179709) (← links)
