The following pages link to Özlem Ergun (Q545532):
Displaying 19 items.
- Rapidly computing robust minimum capacity s-t cuts: a case study in solving a sequence of maximum flow problems (Q545533) (← links)
- A survey of very large-scale neighborhood search techniques (Q697563) (← links)
- (Q858255) (redirect page) (← links)
- Shipper collaboration (Q858256) (← links)
- Mechanism design for a multicommodity flow game in service network alliances (Q957334) (← links)
- (Q1042049) (redirect page) (← links)
- An empirical study on the benefit of split loads with the pickup and delivery problem (Q1042050) (← links)
- A dual heuristic for mixed integer programming (Q1785392) (← links)
- The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability (Q2270321) (← links)
- Creating very large scale neighborhoods out of smaller ones by compounding moves (Q2491337) (← links)
- A dynamic programming methodology in very large scale neighborhood search applied to the traveling salesman problem (Q2494814) (← links)
- Fast neighborhood search for the single machine total weighted tardiness problem (Q2583706) (← links)
- Network Design and Allocation Mechanisms for Carrier Alliances in Liner Shipping (Q3098334) (← links)
- The Post-Disaster Debris Clearance Problem Under Incomplete Information (Q3195231) (← links)
- Optimal job splitting on a multi-slot machine with applications in the printing industry (Q3553743) (← links)
- Collaboration in Cargo Transportation (Q3638512) (← links)
- Allocating Cost of Service to Customers in Inventory Routing (Q5301115) (← links)
- Rapidly Solving an Online Sequence of Maximum Flow Problems with Extensions to Computing Robust Minimum Cuts (Q5387638) (← links)
- Multimodal Transportation Pricing Alliance Design: Large-Scale Optimization for Rapid Gains (Q6508382) (← links)
