Profit-based latency problems on the line
Authors:
- Sofie CoeneSCSofie Coene
- Frits C.R. SpieksmaFSFrits C.R. Spieksma
- 31 May 2008
- journal article
- research article
- Published by Elsevier in Operations Research Letters
- Vol. 36 (3) , 333-337
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- Online-optimization of multi-elevator transport systems with reoptimization algorithms based on set-partitioning modelsDiscrete Applied Mathematics, 2006
- Traveling Salesman Problems with ProfitsTransportation Science, 2005
- Exact algorithms for the minimum latency problemInformation Processing Letters, 2004
- Minimizing Makespan in a Two-Machine Flow Shop with Delays and Unit-Time Operations is NP-HardJournal of Scheduling, 2004
- Computer-Aided Complexity Classification of Dial-a-Ride ProblemsINFORMS Journal on Computing, 2004
- A note on the traveling repairman problemNetworks, 2002
- Polynomial time algorithms for some minimum latency problemsInformation Processing Letters, 2000
- Technical Note—Routing and Location-Routing p-Delivery Men Problems on a PathTransportation Science, 1994
- Routing and Scheduling on a Shoreline with Release TimesManagement Science, 1990
- The delivery man problem on a tree networkAnnals of Operations Research, 1989