Hande Yaman

From MaRDI portal


List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Formulations and valid inequalities for the capacitated dispersion problem
Networks
2023-12-18Paper
A joint demand and supply management approach to large scale urban evacuation planning: evacuate or shelter-in-place, staging and dynamic resource allocation
European Journal of Operational Research
2023-11-15Paper
Short paper -- A note on robust combinatorial optimization with generalized interval uncertainty
OJMO. Open Journal of Mathematical Optimization
2023-08-09Paper
Cargo securing under multi-drop and axle weight constraints
European Journal of Operational Research
2023-07-03Paper
Robust alternative fuel refueling station location problem with routing under decision-dependent flow uncertainty
European Journal of Operational Research
2022-12-19Paper
The TSP with drones: The benefits of retraversing the arcs
 
2022-07-07Paper
A Branch-and-Bound Algorithm for Team Formation on Social Networks
INFORMS Journal on Computing
2022-06-27Paper
An exact solution approach for the inventory routing problem with time windows
Computers & Operations Research
2022-03-09Paper
Convex hull results for generalizations of the constant capacity single node flow set
Mathematical Programming. Series A. Series B
2021-04-23Paper
Exact algorithms for budgeted prize-collecting covering subgraph problems
 
2021-01-10Paper
Multi-stage stochastic programming for demand response optimization
Computers & Operations Research
2020-06-04Paper
A stochastic programming approach for shelter location and evacuation planning
RAIRO - Operations Research
2019-01-18Paper
Convex hull results for the warehouse problem
Discrete Optimization
2019-01-14Paper
The periodic vehicle routing problem with driver consistency
European Journal of Operational Research
2018-11-19Paper
A capacitated hub location problem under hose demand uncertainty
Computers & Operations Research
2018-07-12Paper
Branch-and-price approaches for the network design problem with relays
Computers & Operations Research
2018-07-12Paper
Stochastic lot sizing problem with nervousness considerations
Computers & Operations Research
2018-07-11Paper
The ring/\(\kappa\)-rings network design problem: model and branch-and-cut algorithm
Networks
2018-05-23Paper
New exact solution approaches for the split delivery vehicle routing problem
EURO Journal on Computational Optimization
2018-04-12Paper
Survivability in hierarchical telecommunications networks under dual homing
INFORMS Journal on Computing
2017-03-01Paper
A branch-and-cut algorithm for two-level survivable network design problems
Computers & Operations Research
2016-11-17Paper
Time constrained maximal covering salesman problem with weighted demands and partial coverage
Computers & Operations Research
2016-11-17Paper
A branch-and-cut algorithm for the hub location and routing problem
Computers & Operations Research
2016-11-10Paper
Hierarchical survivable network design problems
 
2016-10-18Paper
Continuous knapsack sets with divisible capacities
Mathematical Programming. Series A. Series B
2016-04-04Paper
Lot sizing with piecewise concave production costs
INFORMS Journal on Computing
2015-01-26Paper
Relaxations for two-level multi-item lot-sizing problems
Mathematical Programming. Series A. Series B
2014-08-29Paper
The splittable flow arc set with capacity and minimum load constraints
Operations Research Letters
2014-05-15Paper
An intermodal multicommodity routing problem with scheduled services
Computational Optimization and Applications
2012-12-12Paper
A polyhedral study of multiechelon lot sizing with intermediate demands
Operations Research
2012-12-07Paper
Release time scheduling and hub location for next-day delivery
Operations Research
2012-12-07Paper
Star \(p\)-hub center problem and star \(p\)-hub median problem with bounded path lengths
Computers & Operations Research
2012-11-15Paper
The robust network loading problem under hose demand uncertainty: formulation, polyhedral analysis, and computations
INFORMS Journal on Computing
2012-07-28Paper
Survivability in hierarchical telecommunications networks
Networks
2012-06-18Paper
Allocation strategies in hub networks
European Journal of Operational Research
2012-05-14Paper
A multi-stage stochastic programming approach in master production scheduling
European Journal of Operational Research
2012-05-14Paper
The vendor location problem
Computers & Operations Research
2011-06-30Paper
Erratum to: ``Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution
Discrete Applied Mathematics
2011-06-28Paper
A Hybrid Polyhedral Uncertainty Model for the Robust Network Loading Problem
Performance Models and Risk Management in Communications Systems
2011-05-09Paper
Health network mergers and hospital re-planning
The Journal of the Operational Research Society
2010-10-14Paper
Generating facets for the independence system polytope
SIAM Journal on Discrete Mathematics
2010-08-27Paper
Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution
Discrete Applied Mathematics
2010-04-28Paper
Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships
Networks
2008-12-17Paper
The Integer Knapsack Cover Polyhedron
SIAM Journal on Discrete Mathematics
2008-08-13Paper
Star \(p\)-hub median problem with modular arc capacities
Computers & Operations Research
2008-03-11Paper
Solving the hub location problem in a star–star network
Networks
2008-01-08Paper
Manufacturer's mixed pallet design problem
European Journal of Operational Research
2007-11-23Paper
Restricted robust uniform matroid maximization under interval uncertainty
Mathematical Programming. Series A. Series B
2007-05-10Paper
Polyhedral analysis for concentrator location problems
Computational Optimization and Applications
2006-11-17Paper
Polyhedral Analysis for the Uncapacitated Hub Location Problem with Modular Arc Capacities
SIAM Journal on Discrete Mathematics
2006-06-01Paper
Formulations and valid inequalities for the heterogeneous vehicle routing problem
Mathematical Programming. Series A. Series B
2006-05-02Paper
Solving the hub location problem with modular link capacities
Computers & Operations Research
2005-09-02Paper
A branch and cut algorithm for hub location problems with single assignment
Mathematical Programming. Series A. Series B
2005-04-19Paper
Concentrator location in telecommunications networks.
Combinatorial Optimization
2005-02-10Paper
Projecting the flow variables for hub location problems
Networks
2005-01-12Paper
Concentrator location in telecommunications
4OR
2004-10-28Paper
scientific article; zbMATH DE number 1803762 (Why is no real title available?)
 
2002-01-01Paper
The robust spanning tree problem with interval data
Operations Research Letters
2001-12-05Paper
On the connected (sub)partition polytope
 
N/APaper


Research outcomes over time


This page was built for person: Hande Yaman