Kiavash Kianfar, Ph.D.
Affiliations: | 2007 | North Carolina State University, Raleigh, NC |
Area:
Operations Research, Industrial EngineeringGoogle:
"Kiavash Kianfar"Parents
Sign in to add mentor| Yahya Fathi | grad student | 2007 | NCSU | |
| (Generalized mixed integer rounding valid inequalities for mixed integer programming problems.) | ||||
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Bansal M, Kianfar K. (2017) Planar Maximum Coverage Location Problem with Partial Coverage and Rectangular Demand and Service Zones Informs Journal On Computing. 29: 152-169 |
| Bansal M, Kianfar K. (2017) Facets for continuous multi-mixing set with general coefficients and bounded integer variables Discrete Optimization. 26: 1-25 |
| Sanjeevi S, Masihabadi S, Kianfar K. (2015) Using cuts for mixed integer knapsack sets to generate cuts for mixed integer polyhedral conic sets Mathematical Programming |
| Bansal M, Kianfar K. (2015) n-Step cycle inequalities: facets for continuous multi-mixing set and strong cuts for multi-module capacitated lot-sizing problem Mathematical Programming |
| Bansal M, Kianfar K. (2014) 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 |
| Bansal M, Kianfar K, Ding Y, et al. (2013) 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 |
| Kianfar K, Moslehi G. (2013) 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 |
| Fathi Y, Kianfar K. (2012) An efficient model for the crosscut optimisation problem in a wood processing mill International Journal of Production Research. 50: 485-497 |
| Sanjeevi S, Kianfar K. (2012) Mixed n-step MIR inequalities: Facets for the n-mixing set Discrete Optimization. 9: 216-235 |
| Kianfar K. (2012) On n-step MIR and partition inequalities for integer knapsack and single-node capacitated flow sets Discrete Applied Mathematics. 160: 1567-1582 |