Profit-based latency problems on the line

DOI10.1016/j.orl.2007.11.001zbMath1152.90533OpenAlexW2103024957MaRDI QIDQ943793

Frits C. R. Spieksma, Sofie Coene

Publication date: 10 September 2008

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://lirias.kuleuven.be/handle/123456789/196136

zbMATH Keywords

complexitydynamic programmingtraveling repairmanminimum latency

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05) Dynamic programming (90C39) Boolean programming (90C09)

Related Items (6)

Integrated production and logistics planning: contract manufacturing and choice of air/surface transportation ⋮ Heuristics for the traveling repairman problem with profits ⋮ Balancing profits and costs on trees ⋮ Emergency path restoration problems ⋮ Hybrid evolutionary search for the traveling repairman problem with profits ⋮ Solving the traveling repairman problem with profits: a novel variable neighborhood search approach

Uses Software

• CP-nets
• DARCLASS

Cites Work

• Unnamed Item
• Unnamed Item
• Polynomial time algorithms for some minimum latency problems
• Exact algorithms for the minimum latency problem
• The delivery man problem on a tree network
• Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard
• Online-optimization of multi-elevator transport systems with reoptimization algorithms based on set-partitioning models
• The minimum latency problem
• Computer-Aided Complexity Classification of Dial-a-Ride Problems
• Routing and Scheduling on a Shoreline with Release Times
• The complexity of the travelling repairman problem
• Technical Note—Routing and Location-Routing p-Delivery Men Problems on a Path
• A note on the traveling repairman problem

This page was built for publication: Profit-based latency problems on the line