Follow
Kiavash Kianfar
Kiavash Kianfar
Associate Professor of Industrial and Systems Engineering, Texas A&M University
Verified email at tamu.edu
Title
Cited by
Cited by
Year
Generalized mixed integer rounding inequalities: facets for infinite group polyhedra
K Kianfar, Y Fathi
Mathematical Programming 120, 313-346, 2009
442009
Planar maximum coverage location problem with partial coverage and rectangular demand and service zones
M Bansal, K Kianfar
INFORMS Journal on Computing 29 (1), 152-169, 2017
372017
A polyhedral study of triplet formulation for single row facility layout problem
S Sanjeevi, K Kianfar
Discrete Applied Mathematics 158 (16), 1861-1867, 2010
302010
Mixed n-step MIR inequalities: Facets for the n-mixing set
S Sanjeevi, K Kianfar
Discrete Optimization 9 (4), 216-235, 2012
242012
Branch‐and‐Bound Algorithms
K Kianfar
Wiley encyclopedia of operations research and management science, 2010
182010
Generating facets for finite master cyclic group polyhedra using n-step mixed integer rounding functions
K Kianfar, Y Fathi
European Journal of Operational Research 207 (1), 105-109, 2010
152010
Facets for continuous multi-mixing set with general coefficients and bounded integer variables
M Bansal, K Kianfar
Discrete Optimization 26, 1-25, 2017
142017
An integer programming approach for analyzing the measurement redundancy in structured linear systems
K Kianfar, A Pourhabib, Y Ding
IEEE Transactions on Automation science and Engineering 8 (2), 447-450, 2010
122010
Optimum Search Schemes for approximate string matching using bidirectional FM-index
K Kianfar, C Pockrandt, B Torkamandi, H Luo, K Reinert
arXiv preprint arXiv:1711.02035, 2017
102017
n-step mingling inequalities: new facets for the mixed-integer knapsack set
A Atamtürk, K Kianfar
Mathematical programming 132, 79-98, 2012
102012
-Step cycle inequalities: facets for continuous multi-mixing set and strong cuts for multi-module capacitated lot-sizing problem
M Bansal, K Kianfar
Mathematical Programming 154 (1), 113-144, 2015
82015
On n-step MIR and partition inequalities for integer knapsack and single-node capacitated flow sets
K Kianfar
Discrete Applied Mathematics 160 (10-11), 1567-1582, 2012
82012
Hybridization of bound-and-decompose and mixed integer feasibility checking to measure redundancy in structured linear systems
M Bansal, K Kianfar, Y Ding, E Moreno-Centeno
IEEE Transactions on Automation Science and Engineering 10 (4), 1151-1157, 2013
62013
Using cuts for mixed integer knapsack sets to generate cuts for mixed integer polyhedral conic sets
S Sanjeevi, S Masihabadi, K Kianfar
Mathematical Programming 159, 571-583, 2016
52016
Reducing pediatric medication errors: A survey and taxonomy
MM Alvarado, L Ntaimo, A Banerjee, K Kianfar
IIE Transactions on Healthcare Systems Engineering 2 (2), 142-155, 2012
52012
n-Step Cycle Inequalities: Facets for Continuous n-Mixing Set and Strong Cuts for Multi-Module Capacitated Lot-Sizing Problem
M Bansal, K Kianfar
Integer Programming and Combinatorial Optimization: 17th International …, 2014
42014
An efficient model for the crosscut optimisation problem in a wood processing mill
Y Fathi, K Kianfar
International journal of production research 50 (2), 485-497, 2012
42012
Optimal Deployment of Emission Reduction Technologies for Large Fleets
M Farzaneh, G Memisoglu, K Kianfar
Transportation research record 2287 (1), 18-26, 2012
22012
An exact algorithm for coverage problem with a single rectangle
M Bansal, K Kianfar
IIE Annual Conference. Proceedings, 1, 2010
22010
A mixed integer programming based recursive variance reduction method for reliability evaluation of linear sensor systems
V Vijayaraghavan, K Kianfar, Y Ding, H Parsaei
2018 IEEE 14th International Conference on Automation Science and …, 2018
12018
The system can't perform the operation now. Try again later.
Articles 1–20