Hande Yaman

According to our database, Hande Yaman authored at least 63 papers between 2001 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2024

A joint demand and supply management approach to large scale urban evacuation planning: Evacuate or shelter-in-place, staging and dynamic resource allocation.

Vedat Bayram, Hande Yaman

Eur. J. Oper. Res., February, 2024

2023

The Traveling Salesman Problem with Drones: The Benefits of Retraversing the Arcs.

Nicola Morandi, Roel Leus, Jannik Matuschke, Hande Yaman

Transp. Sci., September, 2023

Cargo securing under multi-drop and axle weight constraints.

Hatice Çalik, Marc Juwet, Hande Yaman, Greet Vanden Berghe

Eur. J. Oper. Res., May, 2023

Formulations and valid inequalities for the capacitated dispersion problem.

Mercedes Landete, Juanjo Peiró, Hande Yaman

Networks, March, 2023

Short Paper - A Note on Robust Combinatorial Optimization with Generalized Interval Uncertainty.

Hande Yaman

Open J. Math. Optim., January, 2023

Robust alternative fuel refueling station location problem with routing under decision-dependent flow uncertainty.

Özlem Mahmutogullari, Hande Yaman

Eur. J. Oper. Res., 2023

Scheduling with conflicts: formulations, valid inequalities, and computational experiments.

Phablo F. S. Moura, Roel Leus, Hande Yaman

CoRR, 2023

2022

Exact algorithms for budgeted prize-collecting covering subgraph problems.

Nicola Morandi, Roel Leus, Hande Yaman

Comput. Oper. Res., 2022

2021

Hub Location, Routing, and Route Dimensioning: Strategic and Tactical Intermodal Transportation Hub Network Design.

Baris Yildiz, Hande Yaman, Oya Ekin Karasan

Transp. Sci., 2021

Convex hull results for generalizations of the constant capacity single node flow set.

Laurence A. Wolsey, Hande Yaman

Math. Program., 2021

A Branch-and-Bound Algorithm for Team Formation on Social Networks.

Nihal Berktas, Hande Yaman

INFORMS J. Comput., 2021

Two-stage facility location problems with restricted recourse.

Esra Koca, Nilay Noyan, Hande Yaman

IISE Trans., 2021

An exact solution approach for the inventory routing problem with time windows.

Gizem Ozbaygin, Esra Koca, Hande Yaman

Comput. Oper. Res., 2021

2020

Multi-stage stochastic programming for demand response optimization.

Munise Kübra Sahin, Özlem Çavus, Hande Yaman

Comput. Oper. Res., 2020

2019

A Branch-and-Cut Algorithm for the Alternative Fuel Refueling Station Location Problem with Routing.

Okan Arslan, Oya Ekin Karasan, Ali Ridha Mahjoub, Hande Yaman

Transp. Sci., 2019

The periodic vehicle routing problem with driver consistency.

Inmaculada Rodríguez Martín, Juan José Salazar González, Hande Yaman

Eur. J. Oper. Res., 2019

2018

Shelter Location and Evacuation Route Assignment Under Uncertainty: A Benders Decomposition Approach.

Vedat Bayram, Hande Yaman

Transp. Sci., 2018

A stochastic programming approach for Shelter location and evacuation planning.

Vedat Bayram, Hande Yaman

RAIRO Oper. Res., 2018

New exact solution approaches for the split delivery vehicle routing problem.

Gizem Ozbaygin, Oya Ekin Karasan, Hande Yaman

EURO J. Comput. Optim., 2018

Convex hull results for the warehouse problem.

Laurence A. Wolsey, Hande Yaman

Discret. Optim., 2018

Branch-and-price approaches for the network design problem with relays.

Baris Yildiz, Oya Ekin Karasan, Hande Yaman

Comput. Oper. Res., 2018

Stochastic lot sizing problem with nervousness considerations.

Esra Koca, Hande Yaman, M. Selim Akturk

Comput. Oper. Res., 2018

k-node-disjoint hop-constrained survivable networks: polyhedral analysis and branch and cut.

Ibrahima Diarrassouba, Meriem Mahjoub, Ali Ridha Mahjoub, Hande Yaman

Ann. des Télécommunications, 2018

2017

A capacitated hub location problem under hose demand uncertainty.

Merve Merakli, Hande Yaman

Comput. Oper. Res., 2017

2016

The ring/<i>κ</i>-rings network design problem: Model and branch-and-cut algorithm.

Inmaculada Rodríguez Martín, Juan José Salazar González, Hande Yaman

Networks, 2016

Continuous knapsack sets with divisible capacities.

Laurence A. Wolsey, Hande Yaman

Math. Program., 2016

Hierarchical Survivable Network Design Problems.

Inmaculada Rodríguez Martín, Juan José Salazar González, Hande Yaman

Electron. Notes Discret. Math., 2016

Time constrained maximal covering salesman problem with weighted demands and partial coverage.

Gizem Ozbaygin, Hande Yaman, Oya Ekin Karasan

Comput. Oper. Res., 2016

A branch-and-cut algorithm for two-level survivable network design problems.

Inmaculada Rodríguez Martín, Juan José Salazar González, Hande Yaman

Comput. Oper. Res., 2016

2014

Relaxations for two-level multi-item lot-sizing problems.

Mathieu Van Vyve, Laurence A. Wolsey, Hande Yaman

Math. Program., 2014

Matching patient and physician preferences in designing a primary care facility network.

Evrim D. Günes, Hande Yaman, Bora Çekyay, Vedat Verter

J. Oper. Res. Soc., 2014

Multi-period supplier selection under price uncertainty.

Alper Sen, Hande Yaman, Kemal Güler, Evren Körpeoglu

J. Oper. Res. Soc., 2014

Lot Sizing with Piecewise Concave Production Costs.

Esra Koca, Hande Yaman, M. Selim Aktürk

INFORMS J. Comput., 2014

Survivability in Hierarchical Telecommunications Networks Under Dual Homing.

Oya Ekin Karasan, Ali Ridha Mahjoub, Onur Özkök, Hande Yaman

INFORMS J. Comput., 2014

A branch-and-cut algorithm for the hub location and routing problem.

Inmaculada Rodríguez Martín, Juan José Salazar González, Hande Yaman

Comput. Oper. Res., 2014

2013

The splittable flow arc set with capacity and minimum load constraints.

Hande Yaman

Oper. Res. Lett., 2013

2012

Survivability in hierarchical telecommunications networks.

Pierre Fouilhoux, Oya Ekin Karasan, Ali Ridha Mahjoub, Onur Özkök, Hande Yaman

Networks, 2012

A Polyhedral Study of Multiechelon Lot Sizing with Intermediate Demands.

Minjiao Zhang, Simge Küçükyavuz, Hande Yaman

Oper. Res., 2012

Release Time Scheduling and Hub Location for Next-Day Delivery.

Hande Yaman, Oya Ekin Karasan, Bahar Yetis Kara

Oper. Res., 2012

Star p-hub center problem and star p-hub median problem with bounded path lengths.

Hande Yaman, Sourour Elloumi

Comput. Oper. Res., 2012

An intermodal multicommodity routing problem with scheduled services.

Burak Ayar, Hande Yaman

Comput. Optim. Appl., 2012

2011

The Robust Network Loading Problem Under Hose Demand Uncertainty: Formulation, Polyhedral Analysis, and Computations.

Aysegül Altin, Hande Yaman, Mustafa Ç. Pinar

INFORMS J. Comput., 2011

Allocation strategies in hub networks.

Hande Yaman

Eur. J. Oper. Res., 2011

A multi-stage stochastic programming approach in master production scheduling.

Ersin Körpeoglu, Hande Yaman, M. Selim Aktürk

Eur. J. Oper. Res., 2011

Erratum to: Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution [Discrete Appl. Math. 157 (2009) 3133-3151].

Hande Yaman

Discret. Appl. Math., 2011

The vendor location problem.

Yüce Çinar, Hande Yaman

Comput. Oper. Res., 2011

2010

Health network mergers and hospital re-planning.

Evrim D. Günes, Hande Yaman

J. Oper. Res. Soc., 2010

2009

Generating Facets for the Independence System Polytope.

Pierre Fouilhoux, Martine Labbé, Ali Ridha Mahjoub, Hande Yaman

SIAM J. Discret. Math., 2009

Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution.

Hande Yaman

Discret. Appl. Math., 2009

2008

Solving the hub location problem in a star-star network.

Martine Labbé, Hande Yaman

Networks, 2008

Linear inequalities among graph invariants: Using <i>GraPHedron</i> to uncover optimal relationships.

Julie Christophe, Sophie Dewez, Jean-Paul Doignon, Gilles Fasbender, Philippe Grégoire, David Huygens, Martine Labbé, Sourour Elloumi, Hadrien Mélot, Hande Yaman

Networks, 2008

Manufacturer's mixed pallet design problem.

Hande Yaman, Alper Sen

Eur. J. Oper. Res., 2008

Star p-hub median problem with modular arc capacities.

Hande Yaman

Comput. Oper. Res., 2008

2007

The Integer Knapsack Cover Polyhedron.

Hande Yaman

SIAM J. Discret. Math., 2007

Restricted Robust Uniform Matroid Maximization Under Interval Uncertainty.

Hande Yaman, Oya Ekin Karasan, Mustafa Ç. Pinar

Math. Program., 2007

2006

Formulations and Valid Inequalities for the Heterogeneous Vehicle Routing Problem.

Hande Yaman

Math. Program., 2006

Polyhedral Analysis for Concentrator Location Problems.

Martine Labbé, Hande Yaman

Comput. Optim. Appl., 2006

2005

Polyhedral Analysis for the Uncapacitated Hub Location Problem with Modular Arc Capacities.

Hande Yaman

SIAM J. Discret. Math., 2005

A branch and cut algorithm for hub location problems with single assignment.

Martine Labbé, Hande Yaman, Éric Gourdin

Math. Program., 2005

Solving the hub location problem with modular link capacities.

Hande Yaman, Giuliana Carello

Comput. Oper. Res., 2005

2004

Projecting the flow variables for hub location problems.

Martine Labbé, Hande Yaman

Networks, 2004

Concentrator location in telecommunications.

Hande Yaman

4OR, 2004

2001

The robust spanning tree problem with interval data.

Hande Yaman, Oya Ekin Karasan, Mustafa Ç. Pinar

Oper. Res. Lett., 2001