Hande Yaman

69 papers Journal 69
YearRankTypeTitle / Venue / Authors
2025 J jnl
Approximation schemes for covering and packing mixed-integer programs with a fixed number of constraints.
CoRR
Kobe Grobben, Phablo F. S. Moura, Hande Yaman
2025 J jnl
Edge-weighted balanced connected partitions: Hardness and formulations.
CoRR
Morteza Davari, Phablo F. S. Moura, Hande Yaman
2025 J jnl
Pessimistic bilevel optimization approach for decision-focused learning.
CoRR
Diego Jiménez, Bernardo K. Pagnoncelli, Hande Yaman
2024 J jnl
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.
Vedat Bayram, Hande Yaman
2024 J jnl
The Orienteering Problem with Drones.
Transp. Sci.
Nicola Morandi, Roel Leus, Hande Yaman
2024 J jnl
The Vehicle Routing Problem with Access Restrictions.
Transp. Sci.
Munise Kübra Sahin, Hande Yaman
2023 J jnl
Cargo securing under multi-drop and axle weight constraints.
Eur. J. Oper. Res.
Hatice Çalik, Marc Juwet, Hande Yaman, Greet Vanden Berghe
2023 J jnl
Formulations and valid inequalities for the capacitated dispersion problem.
Networks
Mercedes Landete, Juanjo Peiró, Hande Yaman
2023 J jnl
Robust alternative fuel refueling station location problem with routing under decision-dependent flow uncertainty.
Eur. J. Oper. Res.
Özlem Mahmutogullari, Hande Yaman
2023 J jnl
Scheduling with conflicts: formulations, valid inequalities, and computational experiments.
CoRR
Phablo F. S. Moura, Roel Leus, Hande Yaman
2023 J jnl
Short Paper - A Note on Robust Combinatorial Optimization with Generalized Interval Uncertainty.
Open J. Math. Optim.
Hande Yaman
2023 J jnl
The Traveling Salesman Problem with Drones: The Benefits of Retraversing the Arcs.
Transp. Sci.
Nicola Morandi, Roel Leus, Jannik Matuschke, Hande Yaman
2022 J jnl
A Branch and Price Algorithm for the Heterogeneous Fleet Multi-Depot Multi-Trip Vehicle Routing Problem with Time Windows.
Transp. Sci.
Munise Kübra Sahin, Hande Yaman
2022 J jnl
Exact algorithms for budgeted prize-collecting covering subgraph problems.
Comput. Oper. Res.
Nicola Morandi, Roel Leus, Hande Yaman
2021 J jnl
A Branch-and-Bound Algorithm for Team Formation on Social Networks.
INFORMS J. Comput.
Nihal Berktas, Hande Yaman
2021 J jnl
An exact solution approach for the inventory routing problem with time windows.
Comput. Oper. Res.
Gizem Ozbaygin, Esra Koca, Hande Yaman
2021 J jnl
Convex hull results for generalizations of the constant capacity single node flow set.
Math. Program.
Laurence A. Wolsey, Hande Yaman
2021 J jnl
Hub Location, Routing, and Route Dimensioning: Strategic and Tactical Intermodal Transportation Hub Network Design.
Transp. Sci.
Baris Yildiz, Hande Yaman, Oya Ekin Karasan
2021 J jnl
Two-stage facility location problems with restricted recourse.
IISE Trans.
Esra Koca, Nilay Noyan, Hande Yaman
2020 J jnl
Multi-stage stochastic programming for demand response optimization.
Comput. Oper. Res.
Munise Kübra Sahin, Özlem Çavus, Hande Yaman
2019 J jnl
A Branch-and-Cut Algorithm for the Alternative Fuel Refueling Station Location Problem with Routing.
Transp. Sci.
Okan Arslan, Oya Ekin Karasan, Ali Ridha Mahjoub, Hande Yaman
2019 J jnl
The periodic vehicle routing problem with driver consistency.
Eur. J. Oper. Res.
Inmaculada Rodríguez Martín, Juan José Salazar González, Hande Yaman
2018 J jnl
A stochastic programming approach for Shelter location and evacuation planning.
RAIRO Oper. Res.
Vedat Bayram, Hande Yaman
2018 J jnl
Branch-and-price approaches for the network design problem with relays.
Comput. Oper. Res.
Baris Yildiz, Oya Ekin Karasan, Hande Yaman
2018 J jnl
Convex hull results for the warehouse problem.
Discret. Optim.
Laurence A. Wolsey, Hande Yaman
2018 J jnl
New exact solution approaches for the split delivery vehicle routing problem.
EURO J. Comput. Optim.
Gizem Ozbaygin, Oya Ekin Karasan, Hande Yaman
2018 J jnl
Shelter Location and Evacuation Route Assignment Under Uncertainty: A Benders Decomposition Approach.
Transp. Sci.
Vedat Bayram, Hande Yaman
2018 J jnl
Stochastic lot sizing problem with nervousness considerations.
Comput. Oper. Res.
Esra Koca, Hande Yaman, M. Selim Akturk
2018 J jnl
k-node-disjoint hop-constrained survivable networks: polyhedral analysis and branch and cut.
Ann. des Télécommunications
Ibrahima Diarrassouba, Meriem Mahjoub, Ali Ridha Mahjoub, Hande Yaman
2017 J jnl
A capacitated hub location problem under hose demand uncertainty.
Comput. Oper. Res.
Merve Merakli, Hande Yaman
2016 J jnl
A branch-and-cut algorithm for two-level survivable network design problems.
Comput. Oper. Res.
Inmaculada Rodríguez Martín, Juan José Salazar González, Hande Yaman
2016 J jnl
Continuous knapsack sets with divisible capacities.
Math. Program.
Laurence A. Wolsey, Hande Yaman
2016 J jnl
Hierarchical Survivable Network Design Problems.
Electron. Notes Discret. Math.
Inmaculada Rodríguez Martín, Juan José Salazar González, Hande Yaman
2016 J jnl
The ring/
Networks
Inmaculada Rodríguez Martín, Juan José Salazar González, Hande Yaman
2016 J jnl
Time constrained maximal covering salesman problem with weighted demands and partial coverage.
Comput. Oper. Res.
Gizem Ozbaygin, Hande Yaman, Oya Ekin Karasan
2014 J jnl
A branch-and-cut algorithm for the hub location and routing problem.
Comput. Oper. Res.
Inmaculada Rodríguez Martín, Juan José Salazar González, Hande Yaman
2014 J jnl
Lot Sizing with Piecewise Concave Production Costs.
INFORMS J. Comput.
Esra Koca, Hande Yaman, M. Selim Aktürk
2014 J jnl
Matching patient and physician preferences in designing a primary care facility network.
J. Oper. Res. Soc.
Evrim D. Günes, Hande Yaman, Bora Çekyay, Vedat Verter
2014 J jnl
Multi-period supplier selection under price uncertainty.
J. Oper. Res. Soc.
Alper Sen, Hande Yaman, Kemal Güler, Evren Körpeoglu
2014 J jnl
Relaxations for two-level multi-item lot-sizing problems.
Math. Program.
Mathieu Van Vyve, Laurence A. Wolsey, Hande Yaman
2014 J jnl
Survivability in Hierarchical Telecommunications Networks Under Dual Homing.
INFORMS J. Comput.
Oya Ekin Karasan, Ali Ridha Mahjoub, Onur Özkök, Hande Yaman
2013 J jnl
The splittable flow arc set with capacity and minimum load constraints.
Oper. Res. Lett.
Hande Yaman
2012 J jnl
A Polyhedral Study of Multiechelon Lot Sizing with Intermediate Demands.
Oper. Res.
Minjiao Zhang, Simge Küçükyavuz, Hande Yaman
2012 J jnl
An intermodal multicommodity routing problem with scheduled services.
Comput. Optim. Appl.
Burak Ayar, Hande Yaman
2012 J jnl
Release Time Scheduling and Hub Location for Next-Day Delivery.
Oper. Res.
Hande Yaman, Oya Ekin Karasan, Bahar Yetis Kara
2012 J jnl
Star p-hub center problem and star p-hub median problem with bounded path lengths.
Comput. Oper. Res.
Hande Yaman, Sourour Elloumi
2012 J jnl
Survivability in hierarchical telecommunications networks.
Networks
Pierre Fouilhoux, Oya Ekin Karasan, Ali Ridha Mahjoub, Onur Özkök, Hande Yaman
2011 J jnl
A multi-stage stochastic programming approach in master production scheduling.
Eur. J. Oper. Res.
Ersin Körpeoglu, Hande Yaman, M. Selim Aktürk
2011 J jnl
Allocation strategies in hub networks.
Eur. J. Oper. Res.
Hande Yaman
2011 J jnl
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.
Hande Yaman
2011 J jnl
The Robust Network Loading Problem Under Hose Demand Uncertainty: Formulation, Polyhedral Analysis, and Computations.
INFORMS J. Comput.
Aysegül Altin, Hande Yaman, Mustafa Ç. Pinar
2011 J jnl
The vendor location problem.
Comput. Oper. Res.
Yüce Çinar, Hande Yaman
2010 J jnl
Health network mergers and hospital re-planning.
J. Oper. Res. Soc.
Evrim D. Günes, Hande Yaman
2009 J jnl
Generating Facets for the Independence System Polytope.
SIAM J. Discret. Math.
Pierre Fouilhoux, Martine Labbé, Ali Ridha Mahjoub, Hande Yaman
2009 J jnl
Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution.
Discret. Appl. Math.
Hande Yaman
2008 J jnl
Linear inequalities among graph invariants: Using
Networks
Julie Christophe, Sophie Dewez, Jean-Paul Doignon, Gilles Fasbender, Philippe Grégoire, David Huygens, Martine Labbé, Sourour Elloumi, Hadrien Mélot, Hande Yaman
2008 J jnl
Manufacturer's mixed pallet design problem.
Eur. J. Oper. Res.
Hande Yaman, Alper Sen
2008 J jnl
Solving the hub location problem in a star-star network.
Networks
Martine Labbé, Hande Yaman
2008 J jnl
Star p-hub median problem with modular arc capacities.
Comput. Oper. Res.
Hande Yaman
2007 J jnl
Restricted Robust Uniform Matroid Maximization Under Interval Uncertainty.
Math. Program.
Hande Yaman, Oya Ekin Karasan, Mustafa Ç. Pinar
2007 J jnl
The Integer Knapsack Cover Polyhedron.
SIAM J. Discret. Math.
Hande Yaman
2006 J jnl
Formulations and Valid Inequalities for the Heterogeneous Vehicle Routing Problem.
Math. Program.
Hande Yaman
2006 J jnl
Polyhedral Analysis for Concentrator Location Problems.
Comput. Optim. Appl.
Martine Labbé, Hande Yaman
2005 J jnl
A branch and cut algorithm for hub location problems with single assignment.
Math. Program.
Martine Labbé, Hande Yaman, Éric Gourdin
2005 J jnl
Polyhedral Analysis for the Uncapacitated Hub Location Problem with Modular Arc Capacities.
SIAM J. Discret. Math.
Hande Yaman
2005 J jnl
Solving the hub location problem with modular link capacities.
Comput. Oper. Res.
Hande Yaman, Giuliana Carello
2004 J jnl
Concentrator location in telecommunications.
4OR
Hande Yaman
2004 J jnl
Projecting the flow variables for hub location problems.
Networks
Martine Labbé, Hande Yaman
2001 J jnl
The robust spanning tree problem with interval data.
Oper. Res. Lett.
Hande Yaman, Oya Ekin Karasan, Mustafa Ç. Pinar