default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHande Yaman
Person information
- affiliation: Bilkent University, Department of Industrial Engineering, Ankara, Turkey
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[i2]Diego Jiménez, Bernardo K. Pagnoncelli, Hande Yaman:
Pessimistic bilevel optimization approach for decision-focused learning. CoRR abs/2501.16826 (2025)- 2024
- [j65]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): 171-191 (2024) - [j64]Nicola Morandi, Roel Leus, Hande Yaman:
The Orienteering Problem with Drones. Transp. Sci. 58(1): 240-256 (2024) - [j63]Munise Kübra Sahin, Hande Yaman:
The Vehicle Routing Problem with Access Restrictions. Transp. Sci. 58(5): 1101-1120 (2024) - 2023
- [j62]Özlem Mahmutogullari, Hande Yaman:
Robust alternative fuel refueling station location problem with routing under decision-dependent flow uncertainty. Eur. J. Oper. Res. 306(1): 173-188 (2023) - [j61]Hatice Çalik, Marc Juwet, Hande Yaman, Greet Vanden Berghe:
Cargo securing under multi-drop and axle weight constraints. Eur. J. Oper. Res. 307(1): 157-176 (2023) - [j60]Mercedes Landete, Juanjo Peiró, Hande Yaman:
Formulations and valid inequalities for the capacitated dispersion problem. Networks 81(2): 294-315 (2023) - [j59]Hande Yaman:
Short Paper - A Note on Robust Combinatorial Optimization with Generalized Interval Uncertainty. Open J. Math. Optim. 4: 1-7 (2023) - [j58]Nicola Morandi, Roel Leus, Jannik Matuschke, Hande Yaman:
The Traveling Salesman Problem with Drones: The Benefits of Retraversing the Arcs. Transp. Sci. 57(5): 1340-1358 (2023) - [i1]Phablo F. S. Moura, Roel Leus, Hande Yaman:
Scheduling with conflicts: formulations, valid inequalities, and computational experiments. CoRR abs/2312.14777 (2023) - 2022
- [j57]Nicola Morandi, Roel Leus, Hande Yaman:
Exact algorithms for budgeted prize-collecting covering subgraph problems. Comput. Oper. Res. 144: 105798 (2022) - [j56]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): 1636-1657 (2022) - 2021
- [j55]Gizem Ozbaygin, Esra Koca, Hande Yaman:
An exact solution approach for the inventory routing problem with time windows. Comput. Oper. Res. 134: 105371 (2021) - [j54]Esra Koca, Nilay Noyan, Hande Yaman:
Two-stage facility location problems with restricted recourse. IISE Trans. 53(12): 1369-1381 (2021) - [j53]Nihal Berktas, Hande Yaman:
A Branch-and-Bound Algorithm for Team Formation on Social Networks. INFORMS J. Comput. 33(3): 1162-1176 (2021) - [j52]Laurence A. Wolsey, Hande Yaman:
Convex hull results for generalizations of the constant capacity single node flow set. Math. Program. 187(1): 351-382 (2021) - [j51]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): 1351-1369 (2021) - 2020
- [j50]Munise Kübra Sahin, Özlem Çavus, Hande Yaman:
Multi-stage stochastic programming for demand response optimization. Comput. Oper. Res. 118: 104928 (2020)
2010 – 2019
- 2019
- [j49]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): 575-584 (2019) - [j48]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): 1107-1125 (2019) - 2018
- [j47]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): 5-28 (2018) - [j46]Baris Yildiz, Oya Ekin Karasan, Hande Yaman:
Branch-and-price approaches for the network design problem with relays. Comput. Oper. Res. 92: 155-169 (2018) - [j45]Esra Koca, Hande Yaman, M. Selim Akturk:
Stochastic lot sizing problem with nervousness considerations. Comput. Oper. Res. 94: 23-37 (2018) - [j44]Laurence A. Wolsey, Hande Yaman:
Convex hull results for the warehouse problem. Discret. Optim. 30: 108-120 (2018) - [j43]Gizem Ozbaygin, Oya Ekin Karasan, Hande Yaman:
New exact solution approaches for the split delivery vehicle routing problem. EURO J. Comput. Optim. 6(1): 85-115 (2018) - [j42]Vedat Bayram, Hande Yaman:
A stochastic programming approach for Shelter location and evacuation planning. RAIRO Oper. Res. 52(3): 779-805 (2018) - [j41]Vedat Bayram, Hande Yaman:
Shelter Location and Evacuation Route Assignment Under Uncertainty: A Benders Decomposition Approach. Transp. Sci. 52(2): 416-436 (2018) - 2017
- [j40]Merve Merakli, Hande Yaman:
A capacitated hub location problem under hose demand uncertainty. Comput. Oper. Res. 88: 58-70 (2017) - 2016
- [j39]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: 102-112 (2016) - [j38]Gizem Ozbaygin, Hande Yaman, Oya Ekin Karasan:
Time constrained maximal covering salesman problem with weighted demands and partial coverage. Comput. Oper. Res. 76: 226-237 (2016) - [j37]Inmaculada Rodríguez Martín, Juan José Salazar González, Hande Yaman:
Hierarchical Survivable Network Design Problems. Electron. Notes Discret. Math. 52: 229-236 (2016) - [j36]Laurence A. Wolsey, Hande Yaman:
Continuous knapsack sets with divisible capacities. Math. Program. 156(1-2): 1-20 (2016) - [j35]Inmaculada Rodríguez Martín, Juan José Salazar González, Hande Yaman:
The ring/κ-rings network design problem: Model and branch-and-cut algorithm. Networks 68(2): 130-140 (2016) - 2014
- [j34]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: 161-174 (2014) - [j33]Oya Ekin Karasan, Ali Ridha Mahjoub, Onur Özkök, Hande Yaman:
Survivability in Hierarchical Telecommunications Networks Under Dual Homing. INFORMS J. Comput. 26(1): 1-15 (2014) - [j32]Esra Koca, Hande Yaman, M. Selim Aktürk:
Lot Sizing with Piecewise Concave Production Costs. INFORMS J. Comput. 26(4): 767-779 (2014) - [j31]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): 483-496 (2014) - [j30]Alper Sen, Hande Yaman, Kemal Güler, Evren Körpeoglu:
Multi-period supplier selection under price uncertainty. J. Oper. Res. Soc. 65(11): 1636-1648 (2014) - [j29]Mathieu Van Vyve, Laurence A. Wolsey, Hande Yaman:
Relaxations for two-level multi-item lot-sizing problems. Math. Program. 146(1-2): 495-523 (2014) - 2013
- [j28]Hande Yaman:
The splittable flow arc set with capacity and minimum load constraints. Oper. Res. Lett. 41(5): 556-558 (2013) - 2012
- [j27]Burak Ayar, Hande Yaman:
An intermodal multicommodity routing problem with scheduled services. Comput. Optim. Appl. 53(1): 131-153 (2012) - [j26]Hande Yaman, Sourour Elloumi:
Star p-hub center problem and star p-hub median problem with bounded path lengths. Comput. Oper. Res. 39(11): 2725-2732 (2012) - [j25]Hande Yaman, Oya Ekin Karasan, Bahar Yetis Kara:
Release Time Scheduling and Hub Location for Next-Day Delivery. Oper. Res. 60(4): 906-917 (2012) - [j24]Minjiao Zhang, Simge Küçükyavuz, Hande Yaman:
A Polyhedral Study of Multiechelon Lot Sizing with Intermediate Demands. Oper. Res. 60(4): 918-935 (2012) - [j23]Pierre Fouilhoux, Oya Ekin Karasan, Ali Ridha Mahjoub, Onur Özkök, Hande Yaman:
Survivability in hierarchical telecommunications networks. Networks 59(1): 37-58 (2012) - 2011
- [j22]Yüce Çinar, Hande Yaman:
The vendor location problem. Comput. Oper. Res. 38(12): 1678-1695 (2011) - [j21]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): 1058 (2011) - [j20]Hande Yaman:
Allocation strategies in hub networks. Eur. J. Oper. Res. 211(3): 442-451 (2011) - [j19]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): 166-179 (2011) - [j18]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): 75-89 (2011) - 2010
- [j17]Evrim D. Günes, Hande Yaman:
Health network mergers and hospital re-planning. J. Oper. Res. Soc. 61(2): 275-283 (2010)
2000 – 2009
- 2009
- [j16]Hande Yaman:
Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution. Discret. Appl. Math. 157(14): 3133-3151 (2009) - [j15]Pierre Fouilhoux, Martine Labbé, Ali Ridha Mahjoub, Hande Yaman:
Generating Facets for the Independence System Polytope. SIAM J. Discret. Math. 23(3): 1484-1506 (2009) - 2008
- [j14]Hande Yaman:
Star p-hub median problem with modular arc capacities. Comput. Oper. Res. 35(9): 3009-3019 (2008) - [j13]Hande Yaman, Alper Sen:
Manufacturer's mixed pallet design problem. Eur. J. Oper. Res. 186(2): 826-840 (2008) - [j12]Martine Labbé, Hande Yaman:
Solving the hub location problem in a star-star network. Networks 51(1): 19-33 (2008) - [j11]Julie Christophe, Sophie Dewez, Jean-Paul Doignon, Gilles Fasbender, Philippe Grégoire, David Huygens, Martine Labbé, Sourour Elloumi, Hadrien Mélot, Hande Yaman:
Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships. Networks 52(4): 287-298 (2008) - 2007
- [j10]Hande Yaman, Oya Ekin Karasan, Mustafa Ç. Pinar:
Restricted Robust Uniform Matroid Maximization Under Interval Uncertainty. Math. Program. 110(2): 431-441 (2007) - [j9]Hande Yaman:
The Integer Knapsack Cover Polyhedron. SIAM J. Discret. Math. 21(3): 551-572 (2007) - 2006
- [j8]Martine Labbé, Hande Yaman:
Polyhedral Analysis for Concentrator Location Problems. Comput. Optim. Appl. 34(3): 377-407 (2006) - [j7]Hande Yaman:
Formulations and Valid Inequalities for the Heterogeneous Vehicle Routing Problem. Math. Program. 106(2): 365-390 (2006) - 2005
- [j6]Hande Yaman, Giuliana Carello:
Solving the hub location problem with modular link capacities. Comput. Oper. Res. 32: 3227-3245 (2005) - [j5]Martine Labbé, Hande Yaman, Éric Gourdin:
A branch and cut algorithm for hub location problems with single assignment. Math. Program. 102(2): 371-405 (2005) - [j4]Hande Yaman:
Polyhedral Analysis for the Uncapacitated Hub Location Problem with Modular Arc Capacities. SIAM J. Discret. Math. 19(2): 501-522 (2005) - 2004
- [j3]Hande Yaman:
Concentrator location in telecommunications. 4OR 2(2): 175-177 (2004) - [j2]Martine Labbé, Hande Yaman:
Projecting the flow variables for hub location problems. Networks 44(2): 84-93 (2004) - 2001
- [j1]Hande Yaman, Oya Ekin Karasan, Mustafa Ç. Pinar:
The robust spanning tree problem with interval data. Oper. Res. Lett. 29(1): 31-40 (2001)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-04 22:10 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
