Kiavash Kianfar, Ph.D. - Publications

Affiliations: 
2007 North Carolina State University, Raleigh, NC 
Area:
Operations Research, Industrial Engineering

15 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2017 Bansal M, Kianfar K. Planar Maximum Coverage Location Problem with Partial Coverage and Rectangular Demand and Service Zones Informs Journal On Computing. 29: 152-169. DOI: 10.1287/Ijoc.2016.0722  0.344
2017 Bansal M, Kianfar K. Facets for continuous multi-mixing set with general coefficients and bounded integer variables Discrete Optimization. 26: 1-25. DOI: 10.1016/J.Disopt.2017.05.002  0.521
2015 Sanjeevi S, Masihabadi S, Kianfar K. Using cuts for mixed integer knapsack sets to generate cuts for mixed integer polyhedral conic sets Mathematical Programming. DOI: 10.1007/S10107-015-0959-1  0.537
2015 Bansal M, Kianfar K. n-Step cycle inequalities: facets for continuous multi-mixing set and strong cuts for multi-module capacitated lot-sizing problem Mathematical Programming. DOI: 10.1007/S10107-015-0906-1  0.585
2014 Bansal M, Kianfar K. N-Step cycle inequalities: Facets for continuous n-mixing set and strong cuts for multi-module capacitated lot-sizing problem Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8494: 102-113. DOI: 10.1007/978-3-319-07557-0_9  0.37
2013 Bansal M, Kianfar K, Ding Y, Moreno-Centeno E. Hybridization of bound-and-decompose and mixed integer feasibility checking to measure redundancy in structured linear systems Ieee Transactions On Automation Science and Engineering. 10: 1151-1157. DOI: 10.1109/Tase.2013.2259479  0.323
2013 Kianfar K, Moslehi G. A note on "fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date", Discrete Applied Mathematics. 161: 2205-2206. DOI: 10.1016/j.dam.2013.02.026  0.304
2012 Fathi Y, Kianfar K. An efficient model for the crosscut optimisation problem in a wood processing mill International Journal of Production Research. 50: 485-497. DOI: 10.1080/00207543.2010.538446  0.543
2012 Sanjeevi S, Kianfar K. Mixed n-step MIR inequalities: Facets for the n-mixing set Discrete Optimization. 9: 216-235. DOI: 10.1016/J.Disopt.2012.07.003  0.605
2012 Kianfar K. On n-step MIR and partition inequalities for integer knapsack and single-node capacitated flow sets Discrete Applied Mathematics. 160: 1567-1582. DOI: 10.1016/J.Dam.2012.02.025  0.598
2012 Atamtürk A, Kianfar K. N-step mingling inequalities: New facets for the mixed-integer knapsack set Mathematical Programming. 132: 79-98. DOI: 10.1007/S10107-010-0382-6  0.61
2011 Kianfar K, Pourhabib A, Ding Y. An integer programming approach for analyzing the measurement redundancy in structured linear systems Ieee Transactions On Automation Science and Engineering. 8: 447-450. DOI: 10.1109/Tase.2010.2089449  0.405
2010 Kianfar K, Fathi Y. Generating facets for finite master cyclic group polyhedra using n-step mixed integer rounding functions European Journal of Operational Research. 207: 105-109. DOI: 10.1016/J.Ejor.2010.04.021  0.626
2010 Sanjeevi S, Kianfar K. A polyhedral study of triplet formulation for single row facility layout problem Discrete Applied Mathematics. 158: 1861-1867. DOI: 10.1016/J.Dam.2010.07.005  0.473
2009 Kianfar K, Fathi Y. Generalized mixed integer rounding inequalities: Facets for infinite group polyhedra Mathematical Programming. 120: 313-346. DOI: 10.1007/S10107-008-0216-Y  0.634
Show low-probability matches.