HANDE YAMAN

Professor

Bilkent University
Department of Industrial Engineering
Bilkent 06800 Ankara
Turkey
tel: +90 312 290 27 68
fax: +90 312 266 40 54
e-mail: hyaman@bilkent.edu.tr

I received my B.S. and M.S. degrees in Industrial Engineering from Bilkent University in 1997 and 1999, and my Ph.D. degree in Operations Research from Universite Libre de Bruxelles in 2002.
I joined the Department of Industrial Engineering at Bilkent University in 2003. I worked as a visiting researcher at CORE, Universite catholique de Louvain during Sept 2011- Sept 2012.
My research interests are in polyhedral approaches for integer programming with applications in production planning, logistics, and network design.
 

Research Projects
  • Principal Investigator, TUBITAK, Nonlinear Mixed Integer Programming Models for Evacuation Planning, March 2014-March 2016.

  • Researcher,  TUBITAK, Lot Sizing Problem with Capacity Limitations, Controllable Processing Times, and Demand Uncertainty, November 2012-May 2015.
  • Researcher, Tepe Home, Analysis and Optimization of the Logistics Network and Processes at Tepe Home, August 2014-November 2014.
  • Researcher, Hewlett Packard Laboratories - Innovation Research Program, Robust Optimization Modeling for Supplier Selection under Imperfect Information, August 2011-August 2013.

  • Researcher, Hewlett Packard Laboratories - Innovation Research Program, Design and Analysis of Procurement Contracts and Related Bidding Processes, August 2009-August 2011.

  • Principal Investigator, TUBITAK, Polyhedral Analysis and Branch and Cut Algorithms for Network Design Problems with Time Restrictions, September 2008-September 2011.

  • Researcher, TUBITAK, Two Level Survivable Network Design, November 2007-November 2009.

  • Principal Investigator, TUBITAK-CNRS,  Telecommunications, Location and Combinatorial Optimization, in collaboration with Prof. A.R. Mahjoub from Universite Blaise Pascal, Clermont II, April 2006-April 2008.

  • Researcher, France Telecom Research and Development, Concentrator Location in Telecommunication Networks,  2000-2001. 


Publications

  •  I. Rodriquez Martin, J.J. Salazar Gonzalez and H. Yaman, The Periodic Vehicle Routing Problem with Driver Consistency, 2017.
  • L.A. Wolsey and H. Yaman, Convex Hull Results for the Warehouse Problem, 2017.
  • O. Arslan, O.E. Karasan, A.R. Mahjoub and H. Yaman, A Branch-and-Cut Approach for the Alternative Fuel Refueling Station Location Problem, 2017.
  • Baris Yildiz, O.E. Karasan and H. Yaman, Branch-and-Price Approaches for the Network Design Problem with Relays, Computers and Operations Research 92, 155-169, 2018.
  • E. Koca, H. Yaman and M.S. Akturk, Stochastic Lot Sizing Problem with Nervousness Considerations, to appear in Computers and Operations Research.
  • I. Diarrassouba, M. Mahjoub, A.R. Mahjoub, and H. Yaman, k-node-disjoint Hop-constrained Survivable Networks: Polyhedral Analysis and Branch and Cut, to appear in Annals of Telecommunications.
  • G. Ozbaygin, O.E. Karasan and H. Yaman,  New Exact Solution Approaches for the Split Delivery Vehicle Routing Problem, to appear in EURO Journal on Computational Optimization.
  • V. Bayram and H. Yaman, Shelter Location and Evacuation Route Assignment under Uncertainty: A Benders Decomposition Approach, to appear in Transportation Science.
  • V. Bayram and H. Yaman, A Stochastic Programming Approach for Shelter Location and Evacuation Planning, to appear in RAIRO.

  • M. Merakli and H. Yaman, A Capacitated Hub Location Problem under Hose Demand Uncertainty, Computers and Operations Research 88, 58-70, 2017.
  • G. Ozbaygin, O.E. Karasan, M. Savelsbergh and H. Yaman, A Branch-and-Price Algorithm for the Vehicle Routing Problem with Roaming Delivery Locations, Transportation Research Part B 100, 115-137, 2017.
  • G. Ozbaygin, H. Yaman and O.E. Karasan, Time Constrained Maximal Covering Salesman Problem with Weighted Demands and Partial Coverage, Computers and Operations Research 76, 226-237, 2016.
  • I. Rodriquez Martin, J.J. Salazar Gonzalez and H. Yaman,The Ring/K-Rings Network Design Problem: Model and Branch-and-Cut Algorithm, Networks 68, 130-140, 2016.

  • M. Merakli and H. Yaman, Robust Intermodal Hub Location under Polyhedral Demand Uncertainty, Transportation Research Part B 86, 66-85, 2016.
  • I. Rodriquez Martin, J.J. Salazar Gonzalez and H. Yaman, A Branch-and-cut Algorithm for Two-Level Survivable Network Design Problems,  Computers and Operations Research 67, 102-112, 2016.

  • I. Rodriquez Martin, J.J. Salazar Gonzalez and H. Yaman, Hierarchical Survivable Network Design Problems, Electronic Notes in Discrete Mathematics 52, 229-236, 2016.
  • L.A. Wolsey and H. Yaman, Continuous Knapsack Sets with Divisible Capacities, Mathematical Programming 156, 1-20, 2016 (link). 

  • H. Calik, M. Labbe and H. Yaman, p-Center Problems, in Location Science, G. Laporte, S. Nickel and F. Saldanha da Gama (Eds.), 79-92, Springer, 2015 (link).

  • E. Koca, H. Yaman, M.S. Akturk, Stochastic Lot Sizing Problem with Controllable Processing Times, Omega 53, 1-10, 2015 (link).

  • V. Bayram, B.C. Tansel and H. Yaman, Comprimising System and User Interests in Shelter Location and Evacuation Planning, Transportation Research Part B 72, 146-163, 2015 (link).
  • A. Sen, H. Yaman, K. Guler and E. Korpeoglu, Multi-period Supplier Selection under Price Uncertainty, Journal of the Operational Research Society 65, 1636-1648, 2014 (link).

  • E. Koca, H. Yaman, M.S. Akturk, Lot Sizing with Piecewise Concave Production Costs, Bilkent University, INFORMS Journal on Computing 26, 767-779, 2014 (instances), (link).

  • I. Rodriquez Martin, J.J. Salazar Gonzalez and H. Yaman, A Branch-and-cut Algorithm for the Hub Location and Routing Problem, Computers and Operations Research 50, 161-174, 2014 (link).

  • M. Van Vyve, L.A. Wolsey and H. Yaman, Relaxations for Two-Level Multi-Item Lot-Sizing Problems, Mathematical Programming 146, 495-523, 2014 (link).

  • E.D. Gunes,  H. Yaman, B. Cekyay and V. Verter,  Matching Patient and Physician Preferences in Designing a Primary Care Facility Network, Journal of the Operational Research Society 65, 483-496, 2014 (link).

  • O.E. Karasan, A.R. Mahjoub, O. Ozkok and H. Yaman,  Survivability in Hierarchical Telecommunications Networks under Dual Homing, INFORMS Journal on Computing 26(1), 1-15, 2014 (link). 

  • H. Yaman,  The Splittable Flow Arc Set with Capacity and Minimum Load Constraints, Operations Research Letters 41(5), 556-558, 2013 (link). 

  • M. Zhang, S. Kucukyavuz and H. Yaman,  A Polyhedral Study of Multi-Echelon Lot Sizing with Intermediate Demands, Operations Research 60, 918-935, 2012 (first place in George Nicholson Student Paper Competition, 2012) (link).

  • H. Yaman, O.E. Karasan and B.Y. Kara,  Release Time Scheduling and Hub Location for Next Day Delivery, Operations Research 60, 906-917, 2012 (link).

  • B. Ayar and H. Yaman,  An Intermodal Multicommodity Routing Problem with Scheduled Services, Computational Optimization and Applications 53, 131-153, 2012 (link).

  • S.A. Alumur, H. Yaman and B.Y. Kara,  Hierarchical Multimodal Hub Location Problem with Time-definite Deliveries, Transportation Research Part E 48, 1107-1120, 2012 (link).

  • H. Yaman and S. Elloumi,  Star p-hub Center Problem and Star p-hub Median Problem with Bounded Path Lengths, Computers and Operations Research 39, 2725-2732, 2012 (link).

  • P. Fouilhoux, O.E. Karasan, A.R. Mahjoub, O. Ozkok and H. Yaman,  Survivability in Hierarchical Telecommunications Networks, Networks 59, 3758, 2012 (link).

  • E. Korpeoglu, H. Yaman and M.S. Akturk,  A Multi-Stage Stochastic Programming Approach in Master Production Scheduling, European Journal of Operational Research 213, 166-179, 2011 (link).

  • Y. Cinar and H. Yaman,  The Vendor Location Problem, Computers and Operations Research 38, 1678-1695, 2011 (link).

  • A. Altin, H. Yaman and M.C. Pinar,  The Robust Network Loading Problem Under Hose Demand Uncertainty: Formulation, Polyhedral Analysis, and Computations, INFORMS Journal on Computing 23, 75-89, 2011 (link).

  • H. Yaman,  Allocation Strategies in Hub Networks, European Journal of Operational Research 211, 442-451, 2011 (link).

  • A. Altin, H. Yaman and M.C. Pinar,  A Hybrid Polyhedral Uncertainty Model for the Robust Network Loading Problem, in Performance Models and Risk Management in Communications Systems, N. Gulpinar, P. Harrison, and B. Rustem (Eds.), 157-172, Springer, 2011 (link).

  • E.D. Gunes and H. Yaman,  Health Network Mergers and Hospital Re-Planning, Journal of the Operational Research Society 61, 275-283, 2010 (link).

  • P. Fouilhoux, M. Labbe, A.R. Mahjoub and H. Yaman,  Generating Facets for the Independence System Polytope, SIAM Journal on Discrete Mathematics 23 1484-1506, 2009 (link).

  • H. Yaman,  Polyhedral Analysis for the Two Item Uncapacitated Lot Sizing Problem with One Way Substitution, Discrete Applied Mathematics 157, 3133-3151, 2009  (link).

  • H. Yaman,  The Hierarchical Hub Median Problem with Single Assignment, Transportation Research Part B 43, 643-658, 2009 (link).

  • J. Christophe, S. Dewez, J. Doignon, S. Elloumi, G. Fasbender, P. Gregoire, D. Huygens, M. Labbe, H. Melot and H. Yaman,  Linear Inequalities Among Graph Invariants: Using GraPHedron to Uncover Optimal Relationships, Networks 52, 287-298, 2008 (link).

  • H. Yaman,  Star p-hub Median Problem with Modular Arc Capacities, Computers and Operations Research 35, 3009-3019, 2008 (link).

  • M. Labbe and H. Yaman, Solving the Hub Location Problem in a Star-Star Network, Networks 51, 19-33, 2008 (link).

  • H. Yaman and A. Sen,  Manufacturer's Mixed Pallet Design Problem, European Journal of Operational Research 186, 826-840, 2008 (link).

  • H. Yaman,  The Integer Knapsack Cover Polyhedron, SIAM Journal on Discrete Mathematics 21, 551-572, 2007 (link).

  • H. Yaman, B.Y. Kara and B. Tansel,  The Latest Arrival Hub Location Problem for Cargo Delivery Systems, Transportation Research Part B 41, 906-919, 2007 (link).

  • H. Yaman, O.E. Karasan and M.C. Pinar,  Restricted Robust Uniform Matroid Maximization Under Interval Uncertainty, Mathematical Programming 110, 431-441, 2007 (link).

  • S. Ayabakan, A. Celik, E. Erdogan, C. Karakan, S. Kocak, D. Konur, and H. Yaman,  Damacana Su Pazar Analizi ve Dagitim Agi Tasarimi, Endustri Muhendisligi 18(3), 2-12, 2007 (link).

  • M. Labbe and H. Yaman, Polyhedral Analysis for Concentrator Location Problems, Computational Optimization and Applications 34, 377-407, 2006 (link).

  • H. Yaman,  Formulations and Valid Inequalities for the Heterogeneous Vehicle Routing Problem, Mathematical Programming 106, 365-390, 2006 (link).

  • E.D. Gunes and H. Yaman,  Modeling Change in a Health System: Implications on Patient Flows and Resource Allocations, Clinical and Investigative Medicine 28, 331-333, 2005 (link).

  • H. Yaman,  Polyhedral Analysis for the Uncapacitated Hub Location Problem with Modular Arc Capacities, SIAM Journal on Discrete Mathematics 19, 501-522, 2005 (link).

  • H. Yaman and G. Carello, Solving the Hub Location Problem with Modular Link Capacities, Computers and Operations Research 32, 3227-3245, 2005 (link).

  • M. Labbe, H. Yaman and E. Gourdin,  A Branch and Cut Algorithm for Hub Location Problems with Single Assignment, Mathematical Programming 102, 371-405, 2005 (link).

  • H. Yaman,  Concentrator Location in Telecommunications Networks, Springer, 2005 (link).

  • O.E. Karasan, M.C. Pinar and H. Yaman,  Robust DWDM Routing and Provisioning under Polyhedral Demand Uncertainty, Technical Report, Bilkent University, Department of Industrial Engineering, 2005 (pdf).

  • M. Labbe and H. Yaman, Projecting the Flow Variables for Hub Location Problems, Networks 44, 84-93, 2004 (link).

  • H. Yaman,  Concentrator Location in Telecommunications, Ph.D. Thesis Abstract, 4OR 2, 175-177, 2004 (link).

  • V.A. Dincerler, N.E. Guven, M.M. Tanrikulu, M. Temel, M. Yitmen and H. Yaman,  Bilkent Universitesi Personel Tasima Sistemi icin Etkin ve Ekonomik Cozum, Endustri Muhendisligi 15(2), 2-14, 2004 (link).

  • E. Gourdin, M.Labbe and H.Yaman,  Telecommunication and Location, in Facility Location: Applications and Theory, Z.Drezner and H.W. Hamacher (Eds.), 275-205, Springer, 2002.

  • H. Yaman, O.E. Karasan and M.C. Pinar,  The Robust Spanning Tree Problem with Interval Data, Operations Research Letters 29, 31-40, 2001 (link).

  • O.E. Karasan, M.C. Pinar and H. Yaman,  The Robust Shortest Path Problem with Interval Data, Technical Report, Bilkent University, Department of Industrial Engineering, 2001 (pdf).

  • H. Yaman. Essays on Some Combinatorial Optimization Problems with Interval Data,  M.S Thesis. Bilkent University, Department of Industrial Engineering, 1999 (pdf).

Service

  • Reviewer for 4OR, Computational Optimization and Applications, Computer Networks, Computers and Operations Research, Discrete Applied Mathematics, Discrete Optimization, European Journal of Industrial Engineering, European Journal of Operational Research, IEEE Transactions on Automation Science and Engineering, INFOR, INFORMS Journal on Computing, International Transactions in Operational Research, Journal of the Operational Research Society, Mathematical Programming, Naval Research Logistics, Networks, Networks and Spatial Economics, Operations Research, Operations Research Letters, Transportation Research Part B, Transportation Research Part E, Transportation Science.
  • Reviewer for Mathematical Reviews (2005 - 2008), TUBITAK (Turkey), MITACS (Canada), la Region Wallonne (Belgium).
  • Member of the Organizing Committee for Barbaros Tansel Memorial Lecture Series (2014 - ), Co-organizer of the Optimization cluster for YA/EM2015 (Yoneylem Arastirmasi ve Endustri Muhendisligi 35. Ulusal Kongresi, Ankara, Turkey), Member of the Program Committee for INOC 2017 (International Network Optimization Conference, Lisbon, Portugal), ISCO 2016 (4th International Symposium on Combinatorial Optimization, Vietri sul Mare, Italy), COSI'2014 (Colloque sur l'Optimisation et les Systemes d'Information, Bejaia, Algeria), ISCO 2014 (3rd International Symposium on Combinatorial Optimization, Lisbon, Portugal), International IIE Conference 2013 (Istanbul, Turkey), ISCO 2012 (2nd International Symposium on Combinatorial Optimization, Athens, Greece), CIE39 2009 (International Conference on Computers and Industrial Engineering, Troyes, France) and YA/EM 2009 (Yoneylem Arastirmasi ve Endustri Muhendisligi 29. Ulusal Kongresi, Ankara, Turkey), Member of the Steering Committee for IWLS 2013 (International Workshop on Lot Sizing, Brussels, Belgium), Member of the Scientific Committee for INOC 2013 (International Network Optimization Conference, Tenerife, Spain), Member of the Technical Program Committee for INOC 2015 (International Network Optimization Conference, Warsaw, Poland), Member of the Local Committee for EWGLA XX 2013 (EURO Working Group on Locational Analysis Meeting, Ankara, Turkey).