Adaptive labeling algorithms for the dynamic assignment problem
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1057929
- A labeling algorithm to solve the assignment problem
- Solving dynamic labeling problems to optimality using solution space reductions
- 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
- Adaptive heuristic for the generalized assignment problem
- Exact algorithms and bounds for the dynamic assignment interdiction problem
- scientific article; zbMATH DE number 7364985
Cited in
(12)- A memetic algorithm for the multiperiod vehicle routing problem with profit
- A labeling method for dynamic driver-task assignment with uncertain task durations
- Balanced dynamic multiple travelling salesmen: algorithms and continuous approximations
- On the value of optimal myopic solutions for dynamic routing and scheduling problems in the presence of user noncompliance
- Approximation Algorithms on Consistent Dynamic Map Labeling
- scientific article; zbMATH DE number 1057929 (Why is no real title available?)
- A Stochastic Formulation of the Dynamic Assignment Problem, with an Application to Truckload Motor Carriers
- An Adaptive Dynamic Programming Algorithm for the Heterogeneous Resource Allocation Problem
- scientific article; zbMATH DE number 2223043 (Why is no real title available?)
- Stochastic scheduling and routing decisions in online meal delivery platforms with mixed force
- A general vehicle routing problem
- Adaptive demand peak management in online transport process planning
This page was built for publication: Adaptive labeling algorithms for the dynamic assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2783873)