Hande Yaman

Publication Activity (10 Years)

Years Active: 2001-2024
Publications (10 Years): 31

Top Topics

Routing Problem

Network Design Problem

Top Venues

Comput. Oper. Res.

Eur. J. Oper. Res.

INFORMS J. Comput.

Publications

Vedat Bayram, Hande Yaman
A joint demand and supply management approach to large scale urban evacuation planning: Evacuate or shelter-in-place, staging and dynamic resource allocation. Eur. J. Oper. Res. 313 (1) (2024)
Nicola Morandi, Roel Leus, Hande Yaman
The Orienteering Problem with Drones. Transp. Sci. 58 (1) (2024)
Hande Yaman
Short Paper - A Note on Robust Combinatorial Optimization with Generalized Interval Uncertainty. Open J. Math. Optim. 4 (2023)
Mercedes Landete, Juanjo Peiró, Hande Yaman
Formulations and valid inequalities for the capacitated dispersion problem. Networks 81 (2) (2023)
Phablo F. S. Moura, Roel Leus, Hande Yaman
Scheduling with conflicts: formulations, valid inequalities, and computational experiments. CoRR (2023)
Hatice Çalik, Marc Juwet, Hande Yaman, Greet Vanden Berghe
Cargo securing under multi-drop and axle weight constraints. Eur. J. Oper. Res. 307 (1) (2023)
Nicola Morandi, Roel Leus, Jannik Matuschke, Hande Yaman
The Traveling Salesman Problem with Drones: The Benefits of Retraversing the Arcs. Transp. Sci. 57 (5) (2023)
Özlem Mahmutogullari, Hande Yaman
Robust alternative fuel refueling station location problem with routing under decision-dependent flow uncertainty. Eur. J. Oper. Res. 306 (1) (2023)
Munise Kübra Sahin, Hande Yaman
A Branch and Price Algorithm for the Heterogeneous Fleet Multi-Depot Multi-Trip Vehicle Routing Problem with Time Windows. Transp. Sci. 56 (6) (2022)
Nicola Morandi, Roel Leus, Hande Yaman
Exact algorithms for budgeted prize-collecting covering subgraph problems. Comput. Oper. Res. 144 (2022)
Gizem Ozbaygin, Esra Koca, Hande Yaman
An exact solution approach for the inventory routing problem with time windows. Comput. Oper. Res. 134 (2021)
Nihal Berktas, Hande Yaman
A Branch-and-Bound Algorithm for Team Formation on Social Networks. INFORMS J. Comput. 33 (3) (2021)
Baris Yildiz, Hande Yaman, Oya Ekin Karasan
Hub Location, Routing, and Route Dimensioning: Strategic and Tactical Intermodal Transportation Hub Network Design. Transp. Sci. 55 (6) (2021)
Esra Koca, Nilay Noyan, Hande Yaman
Two-stage facility location problems with restricted recourse. IISE Trans. 53 (12) (2021)
Laurence A. Wolsey, Hande Yaman
Convex hull results for generalizations of the constant capacity single node flow set. Math. Program. 187 (1) (2021)
Munise Kübra Sahin, Özlem Çavus, Hande Yaman
Multi-stage stochastic programming for demand response optimization. Comput. Oper. Res. 118 (2020)
Inmaculada Rodríguez Martín, Juan José Salazar González, Hande Yaman
The periodic vehicle routing problem with driver consistency. Eur. J. Oper. Res. 273 (2) (2019)
Okan Arslan, Oya Ekin Karasan, Ali Ridha Mahjoub, Hande Yaman
A Branch-and-Cut Algorithm for the Alternative Fuel Refueling Station Location Problem with Routing. Transp. Sci. 53 (4) (2019)
Gizem Ozbaygin, Oya Ekin Karasan, Hande Yaman
New exact solution approaches for the split delivery vehicle routing problem. EURO J. Comput. Optim. 6 (1) (2018)
Baris Yildiz, Oya Ekin Karasan, Hande Yaman
Branch-and-price approaches for the network design problem with relays. Comput. Oper. Res. 92 (2018)
Vedat Bayram, Hande Yaman
Shelter Location and Evacuation Route Assignment Under Uncertainty: A Benders Decomposition Approach. Transp. Sci. 52 (2) (2018)
Esra Koca, Hande Yaman, M. Selim Akturk
Stochastic lot sizing problem with nervousness considerations. Comput. Oper. Res. 94 (2018)
Vedat Bayram, Hande Yaman
A stochastic programming approach for Shelter location and evacuation planning. RAIRO Oper. Res. 52 (3) (2018)
Ibrahima Diarrassouba, Meriem Mahjoub, Ali Ridha Mahjoub, Hande Yaman
k-node-disjoint hop-constrained survivable networks: polyhedral analysis and branch and cut. Ann. des Télécommunications 73 (1-2) (2018)
Laurence A. Wolsey, Hande Yaman
Convex hull results for the warehouse problem. Discret. Optim. 30 (2018)
Merve Merakli, Hande Yaman
A capacitated hub location problem under hose demand uncertainty. Comput. Oper. Res. 88 (2017)
Laurence A. Wolsey, Hande Yaman
Continuous knapsack sets with divisible capacities. Math. Program. 156 (1-2) (2016)
Inmaculada Rodríguez Martín, Juan José Salazar González, Hande Yaman
-rings network design problem: Model and branch-and-cut algorithm. Networks 68 (2) (2016)
Inmaculada Rodríguez Martín, Juan José Salazar González, Hande Yaman
Hierarchical Survivable Network Design Problems. Electron. Notes Discret. Math. 52 (2016)
Gizem Ozbaygin, Hande Yaman, Oya Ekin Karasan
Time constrained maximal covering salesman problem with weighted demands and partial coverage. Comput. Oper. Res. 76 (2016)
Inmaculada Rodríguez Martín, Juan José Salazar González, Hande Yaman
A branch-and-cut algorithm for two-level survivable network design problems. Comput. Oper. Res. 67 (2016)
Inmaculada Rodríguez Martín, Juan José Salazar González, Hande Yaman
A branch-and-cut algorithm for the hub location and routing problem. Comput. Oper. Res. 50 (2014)
Esra Koca, Hande Yaman, M. Selim Aktürk
Lot Sizing with Piecewise Concave Production Costs. INFORMS J. Comput. 26 (4) (2014)
Evrim D. Günes, Hande Yaman, Bora Çekyay, Vedat Verter
Matching patient and physician preferences in designing a primary care facility network. J. Oper. Res. Soc. 65 (4) (2014)
Mathieu Van Vyve, Laurence A. Wolsey, Hande Yaman
Relaxations for two-level multi-item lot-sizing problems. Math. Program. 146 (1-2) (2014)
Oya Ekin Karasan, Ali Ridha Mahjoub, Onur Özkök, Hande Yaman
Survivability in Hierarchical Telecommunications Networks Under Dual Homing. INFORMS J. Comput. 26 (1) (2014)
Alper Sen, Hande Yaman, Kemal Güler, Evren Körpeoglu
Multi-period supplier selection under price uncertainty. J. Oper. Res. Soc. 65 (11) (2014)
Hande Yaman
The splittable flow arc set with capacity and minimum load constraints. Oper. Res. Lett. 41 (5) (2013)
Burak Ayar, Hande Yaman
An intermodal multicommodity routing problem with scheduled services. Comput. Optim. Appl. 53 (1) (2012)
Hande Yaman, Sourour Elloumi
Star p-hub center problem and star p-hub median problem with bounded path lengths. Comput. Oper. Res. 39 (11) (2012)
Pierre Fouilhoux, Oya Ekin Karasan, Ali Ridha Mahjoub, Onur Özkök, Hande Yaman
Survivability in hierarchical telecommunications networks. Networks 59 (1) (2012)
Hande Yaman, Oya Ekin Karasan, Bahar Yetis Kara
Release Time Scheduling and Hub Location for Next-Day Delivery. Oper. Res. 60 (4) (2012)
Minjiao Zhang, Simge Küçükyavuz, Hande Yaman
A Polyhedral Study of Multiechelon Lot Sizing with Intermediate Demands. Oper. Res. 60 (4) (2012)
Aysegül Altin, Hande Yaman, Mustafa Ç. Pinar
The Robust Network Loading Problem Under Hose Demand Uncertainty: Formulation, Polyhedral Analysis, and Computations. INFORMS J. Comput. 23 (1) (2011)
Hande Yaman
Erratum to: Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution [Discrete Appl. Math. 157 (2009) 3133-3151]. Discret. Appl. Math. 159 (10) (2011)
Yüce Çinar, Hande Yaman
The vendor location problem. Comput. Oper. Res. 38 (12) (2011)
Hande Yaman
Allocation strategies in hub networks. Eur. J. Oper. Res. 211 (3) (2011)
Ersin Körpeoglu, Hande Yaman, M. Selim Aktürk
A multi-stage stochastic programming approach in master production scheduling. Eur. J. Oper. Res. 213 (1) (2011)
Evrim D. Günes, Hande Yaman
Health network mergers and hospital re-planning. J. Oper. Res. Soc. 61 (2) (2010)
Pierre Fouilhoux, Martine Labbé, Ali Ridha Mahjoub, Hande Yaman
Generating Facets for the Independence System Polytope. SIAM J. Discret. Math. 23 (3) (2009)
Hande Yaman
Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution. Discret. Appl. Math. 157 (14) (2009)
Martine Labbé, Hande Yaman
Solving the hub location problem in a star-star network. Networks 51 (1) (2008)
Hande Yaman
Star p-hub median problem with modular arc capacities. Comput. Oper. Res. 35 (9) (2008)
Hande Yaman, Alper Sen
Manufacturer's mixed pallet design problem. Eur. J. Oper. Res. 186 (2) (2008)
Julie Christophe, Sophie Dewez, Jean-Paul Doignon, Gilles Fasbender, Philippe Grégoire, David Huygens, Martine Labbé, Sourour Elloumi, Hadrien Mélot, Hande Yaman
to uncover optimal relationships. Networks 52 (4) (2008)
Hande Yaman, Oya Ekin Karasan, Mustafa Ç. Pinar
Restricted Robust Uniform Matroid Maximization Under Interval Uncertainty. Math. Program. 110 (2) (2007)
Hande Yaman
The Integer Knapsack Cover Polyhedron. SIAM J. Discret. Math. 21 (3) (2007)
Hande Yaman
Formulations and Valid Inequalities for the Heterogeneous Vehicle Routing Problem. Math. Program. 106 (2) (2006)
Martine Labbé, Hande Yaman
Polyhedral Analysis for Concentrator Location Problems. Comput. Optim. Appl. 34 (3) (2006)
Hande Yaman
Polyhedral Analysis for the Uncapacitated Hub Location Problem with Modular Arc Capacities. SIAM J. Discret. Math. 19 (2) (2005)
Hande Yaman, Giuliana Carello
Solving the hub location problem with modular link capacities. Comput. Oper. Res. 32 (2005)
Martine Labbé, Hande Yaman, Éric Gourdin
A branch and cut algorithm for hub location problems with single assignment. Math. Program. 102 (2) (2005)
Hande Yaman
Concentrator location in telecommunications. 4OR 2 (2) (2004)
Martine Labbé, Hande Yaman
Projecting the flow variables for hub location problems. Networks 44 (2) (2004)
Hande Yaman, Oya Ekin Karasan, Mustafa Ç. Pinar
The robust spanning tree problem with interval data. Oper. Res. Lett. 29 (1) (2001)