Hande Yaman
According to our database^{1},
Hande Yaman
authored at least 48 papers
between 2001 and 2020.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Online presence:

on orcid.org
On csauthors.net:
Bibliography
2020
Comput. Oper. Res., 2020
2019
A BranchandCut Algorithm for the Alternative Fuel Refueling Station Location Problem with Routing.
Transp. Sci., 2019
Eur. J. Oper. Res., 2019
2018
Shelter Location and Evacuation Route Assignment Under Uncertainty: A Benders Decomposition Approach.
Transp. Sci., 2018
RAIRO Oper. Res., 2018
EURO J. Comput. Optim., 2018
Discret. Optim., 2018
Comput. Oper. Res., 2018
Comput. Oper. Res., 2018
knodedisjoint hopconstrained survivable networks: polyhedral analysis and branch and cut.
Ann. des Télécommunications, 2018
2017
Comput. Oper. Res., 2017
2016
The ring/<i>κ</i>rings network design problem: Model and branchandcut algorithm.
Networks, 2016
Math. Program., 2016
Electron. Notes Discret. Math., 2016
Time constrained maximal covering salesman problem with weighted demands and partial coverage.
Comput. Oper. Res., 2016
Comput. Oper. Res., 2016
2014
Math. Program., 2014
J. Oper. Res. Soc., 2014
INFORMS J. Comput., 2014
INFORMS J. Comput., 2014
Comput. Oper. Res., 2014
2013
Oper. Res. Lett., 2013
2012
Networks, 2012
Oper. Res., 2012
Oper. Res., 2012
Star phub center problem and star phub median problem with bounded path lengths.
Comput. Oper. Res., 2012
Comput. Optim. Appl., 2012
2011
The Robust Network Loading Problem Under Hose Demand Uncertainty: Formulation, Polyhedral Analysis, and Computations.
INFORMS J. Comput., 2011
Eur. J. Oper. Res., 2011
Eur. J. Oper. Res., 2011
Erratum to: Polyhedral analysis for the twoitem uncapacitated lotsizing problem with oneway substitution [Discrete Appl. Math. 157 (2009) 31333151].
Discret. Appl. Math., 2011
Comput. Oper. Res., 2011
2009
SIAM J. Discret. Math., 2009
Polyhedral analysis for the twoitem uncapacitated lotsizing problem with oneway substitution.
Discret. Appl. Math., 2009
2008
Networks, 2008
Linear inequalities among graph invariants: Using <i>GraPHedron</i> to uncover optimal relationships.
Networks, 2008
Eur. J. Oper. Res., 2008
Comput. Oper. Res., 2008
2007
SIAM J. Discret. Math., 2007
Math. Program., 2007
2006
Formulations and Valid Inequalities for the Heterogeneous Vehicle Routing Problem.
Math. Program., 2006
Comput. Optim. Appl., 2006
2005
Polyhedral Analysis for the Uncapacitated Hub Location Problem with Modular Arc Capacities.
SIAM J. Discret. Math., 2005
Math. Program., 2005
Comput. Oper. Res., 2005
2004
Networks, 2004
4OR, 2004
2001
Oper. Res. Lett., 2001