Kiavash Kianfar

Planar Maximum Coverage Location Problem with Partial Coverage and Rectangular Demand and Service Zones

Manish Bansal, Kiavash Kianfar · INFORMS journal on computing · 2017 · 33 citations

Mathematical Programming, Planar Mclp, Engineering +22

A polyhedral study of triplet formulation for single row facility layout problem

Sujeevraja Sanjeevi, Kiavash Kianfar · Discrete Applied Mathematics · 2010 · 29 citations

Mathematical Programming, Facility Planning, Engineering +16

Generalized mixed integer rounding inequalities: facets for infinite group polyhedra

Kiavash Kianfar, Yahya Fathi · Mathematical Programming · 2008 · 28 citations

Mathematical Programming, Discrete Geometry, Engineering +4

n-step mingling inequalities: new facets for the mixed-integer knapsack set

Alper Atamtürk, Kiavash Kianfar · Mathematical Programming · 2010 · 15 citations · Full text

Mathematical Programming, N-step Mir, Engineering +17

Mixed <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si7.gif" display="inline" overflow="scroll"><mml:mi>n</mml:mi></mml:math>-step MIR inequalities: Facets for the <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si8.gif" display="inline" overflow="scroll"><mml:mi>n</mml:mi></mml:math>-mixing set

Sujeevraja Sanjeevi, Kiavash Kianfar · Discrete Optimization · 2012 · 13 citations

Math Xmlns, Discrete Mathematics