Ergun zlem

zlem Ergun

Information about the author zlem Ergun will soon be added to the site.
Found 11 papers in total
The Post-Disaster Debris Clearance Problem Under Incomplete Information
The Post-Disaster Debris Clearance Problem Under Incomplete Information
2015
Debris management is one of the most time consuming and complicated activities among...
Improving Humanitarian Operations through Technology-Enabled Collaboration
Improving Humanitarian Operations through Technology-Enabled Collaboration
2014
Humanitarian supply chains involve many different entities, such as government,...
Lane‐Exchange Mechanisms for Truckload Carrier Collaboration
Lane‐Exchange Mechanisms for Truckload Carrier Collaboration
2011
Because of historically high fuel prices, the trucking industry's operating expenses...
Rapidly computing robust minimum capacity s‐t cuts: a case study in solving a sequence of maximum flow problems
Rapidly computing robust minimum capacity s‐t cuts: a case study in solving a sequence of maximum flow problems
2011
The Minimum Capacity s ‐ t Cut Problem (MinCut) is an intensively studied...
Network Design and Allocation Mechanisms for Carrier Alliances in Liner Shipping
Network Design and Allocation Mechanisms for Carrier Alliances in Liner Shipping
2010
Many real‐world systems operate in a decentralized manner, where individual...
Optimal job splitting on a multi‐slot machine with applications in the printing industry
Optimal job splitting on a multi‐slot machine with applications in the printing industry
2010
In this article, we define a scheduling/packing problem called the Job Splitting...
Mechanism design for a multicommodity flow game in service network alliances
Mechanism design for a multicommodity flow game in service network alliances
2008
We study a collaborative multicommodity flow game where individual players own...
Shipper collaboration
Shipper collaboration
2007
The interest in collaborative logistics is fuelled by the ever increasing pressure on...
A dynamic programming methodology in very large scale neighborhood search applied to the traveling salesman problem
A dynamic programming methodology in very large scale neighborhood search applied to the traveling salesman problem
2006
We consider the standard dynamic program to solve the TSP. We then obtain...
Creating very large scale neighborhoods out of smaller ones by compounding moves
Creating very large scale neighborhoods out of smaller ones by compounding moves
2006
This paper discusses neighborhood search algorithms where the size of the neighborhood...
Fast neighborhood search for the single machine total weighted tardiness problem
Fast neighborhood search for the single machine total weighted tardiness problem
2006
Most successful heuristics for solving I||∑w i T i are based on swap...
Papers per page: