An approximate labelling algorithm for the dynamic assignment problem

MaRDI QIDQ4353004zbMATH OpenFDO

Authors Warren Powell, Derek H. Gittoes

Publication date 1 December 1997

zbMATH Keywords

dynamic assignment problemlabel setting rolling horizon algorithm

Mathematics Subject Classification ID

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

Recommendations

• Adaptive labeling algorithms for the dynamic assignment problem
• A labeling algorithm to solve the assignment problem
• An efficient labeling technique for solving sparse assignment problems
• A labeling algorithm for the sensitivity ranges of the assignment problem
• Approximation algorithms on consistent dynamic map labeling
• Approximation Algorithms on Consistent Dynamic Map Labeling
• Solving dynamic labeling problems to optimality using solution space reductions
• Exact algorithms and bounds for the dynamic assignment interdiction problem
• An approximation algorithm for the generalized assignment problem
• Some fixed-point results for the dynamic assignment problem

Cited in

(3)

• A labeling method for dynamic driver-task assignment with uncertain task durations
• Adaptive labeling algorithms for the dynamic assignment problem
• Approximation Algorithms on Consistent Dynamic Map Labeling

This page was built for publication: An approximate labelling algorithm for the dynamic assignment problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4353004)