On dual based lower bounds for the sequential ordering problem with precedences and due dates
From MaRDI portal
Publication:1417775
DOI10.1023/B:ANOR.0000004765.69773.41zbMath1053.90031MaRDI QIDQ1417775
Antonio Alonso-Ayuso, Paolo Detti, M. Teresa Ortuño, Laureano Fernando Escudero Bueno
Publication date: 6 January 2004
Published in: Annals of Operations Research (Search for Journal in Brave)
Lagrangian relaxationdue datesHamiltonian pathsequential ordering problemprecedencesminimum arborescencepermutation path
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (3)
Exact algorithms for the multi-pickup and delivery problem with time windows ⋮ Minimax regret spanning arborescences under uncertain costs ⋮ The multi-pickup and delivery problem with time windows
This page was built for publication: On dual based lower bounds for the sequential ordering problem with precedences and due dates
