Charlemagne's Challenge: The Periodic Latency Problem

DOI10.1287/opre.1110.0919zbMath1238.90015OpenAlexW2199987713MaRDI QIDQ3109870

Sofie Coene, Frits C. R. Spieksma, Gerhard J. Woeginger

Publication date: 26 January 2012

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

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

zbMATH Keywords

complexityperiodicitylatency problem

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35)

Related Items (3)

Simple strategies versus optimal schedules in multi-agent patrolling ⋮ Approximation algorithms for replenishment problems with fixed turnover times ⋮ A 12/7-approximation algorithm for the discrete bamboo garden trimming problem

This page was built for publication: Charlemagne's Challenge: The Periodic Latency Problem