The following pages link to Kiavash Kianfar (Q312702):
Displaying 12 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)
- A polyhedral study of triplet formulation for single row facility layout problem (Q602769) (← links)
- \(n\)-step cycle inequalities: facets for continuous multi-mixing set and strong cuts for multi-module capacitated lot-sizing problem (Q896282) (← links)
- Generating facets for finite master cyclic group polyhedra using \(n\)-step mixed integer rounding functions (Q992583) (← links)
- Facets for continuous multi-mixing set with general coefficients and bounded integer variables (Q1751241) (← links)
- Mixed \(n\)-step MIR inequalities: facets for the \(n\)-mixing set (Q1926486) (← 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)
- n-Step Cycle Inequalities: Facets for Continuous n-Mixing Set and Strong Cuts for Multi-Module Capacitated Lot-Sizing Problem (Q5418988) (← links)
- Planar Maximum Coverage Location Problem with Partial Coverage and Rectangular Demand and Service Zones (Q5739137) (← links)
- Valid inequalities and facets for multi‐module survivable network design problem (Q6179709) (← links)
