Hande Yaman

According to our database1, Hande Yaman authored at least 48 papers between 2001 and 2020.

Collaborative distances:



In proceedings 
PhD thesis 


Online presence:

On csauthors.net:


Multi-stage stochastic programming for demand response optimization.
Comput. Oper. Res., 2020

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

The periodic vehicle routing problem with driver consistency.
Eur. J. Oper. Res., 2019

Shelter Location and Evacuation Route Assignment Under Uncertainty: A Benders Decomposition Approach.
Transp. Sci., 2018

A stochastic programming approach for Shelter location and evacuation planning.
RAIRO Oper. Res., 2018

New exact solution approaches for the split delivery vehicle routing problem.
EURO J. Comput. Optim., 2018

Convex hull results for the warehouse problem.
Discret. Optim., 2018

Branch-and-price approaches for the network design problem with relays.
Comput. Oper. Res., 2018

Stochastic lot sizing problem with nervousness considerations.
Comput. Oper. Res., 2018

k-node-disjoint hop-constrained survivable networks: polyhedral analysis and branch and cut.
Ann. des Télécommunications, 2018

A capacitated hub location problem under hose demand uncertainty.
Comput. Oper. Res., 2017

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

Continuous knapsack sets with divisible capacities.
Math. Program., 2016

Hierarchical Survivable Network Design Problems.
Electron. Notes Discret. Math., 2016

Time constrained maximal covering salesman problem with weighted demands and partial coverage.
Comput. Oper. Res., 2016

A branch-and-cut algorithm for two-level survivable network design problems.
Comput. Oper. Res., 2016

Relaxations for two-level multi-item lot-sizing problems.
Math. Program., 2014

Multi-period supplier selection under price uncertainty.
J. Oper. Res. Soc., 2014

Lot Sizing with Piecewise Concave Production Costs.
INFORMS J. Comput., 2014

Survivability in Hierarchical Telecommunications Networks Under Dual Homing.
INFORMS J. Comput., 2014

A branch-and-cut algorithm for the hub location and routing problem.
Comput. Oper. Res., 2014

The splittable flow arc set with capacity and minimum load constraints.
Oper. Res. Lett., 2013

Survivability in hierarchical telecommunications networks.
Networks, 2012

A Polyhedral Study of Multiechelon Lot Sizing with Intermediate Demands.
Oper. Res., 2012

Release Time Scheduling and Hub Location for Next-Day Delivery.
Oper. Res., 2012

Star p-hub center problem and star p-hub median problem with bounded path lengths.
Comput. Oper. Res., 2012

An intermodal multicommodity routing problem with scheduled services.
Comput. Optim. Appl., 2012

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

Allocation strategies in hub networks.
Eur. J. Oper. Res., 2011

A multi-stage stochastic programming approach in master production scheduling.
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].
Discret. Appl. Math., 2011

The vendor location problem.
Comput. Oper. Res., 2011

Generating Facets for the Independence System Polytope.
SIAM J. Discret. Math., 2009

Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution.
Discret. Appl. Math., 2009

Solving the hub location problem in a star-star network.
Networks, 2008

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

Manufacturer's mixed pallet design problem.
Eur. J. Oper. Res., 2008

Star p-hub median problem with modular arc capacities.
Comput. Oper. Res., 2008

The Integer Knapsack Cover Polyhedron.
SIAM J. Discret. Math., 2007

Restricted Robust Uniform Matroid Maximization Under Interval Uncertainty.
Math. Program., 2007

Formulations and Valid Inequalities for the Heterogeneous Vehicle Routing Problem.
Math. Program., 2006

Polyhedral Analysis for Concentrator Location Problems.
Comput. Optim. Appl., 2006

Polyhedral Analysis for the Uncapacitated Hub Location Problem with Modular Arc Capacities.
SIAM J. Discret. Math., 2005

A branch and cut algorithm for hub location problems with single assignment.
Math. Program., 2005

Solving the hub location problem with modular link capacities.
Comput. Oper. Res., 2005

Projecting the flow variables for hub location problems.
Networks, 2004

Concentrator location in telecommunications.
4OR, 2004

The robust spanning tree problem with interval data.
Oper. Res. Lett., 2001