An efficient greedy heuristic for the real-time train platforming problem.
Ricardo García-RódenasMaría Luz López-GarcíaLuis CadarsoEsteve CodinaPublished in: Comput. Oper. Res. (2024)
Keyphrases
- greedy heuristic
- real time
- np hard
- greedy algorithm
- knapsack problem
- quality of service
- vision system
- minimum weight
- set cover
- artificial intelligence
- optimal solution
- low cost
- worst case
- worst case analysis
- database
- control system
- computational complexity
- bayesian networks
- case study
- website
- information systems
- search engine
- machine learning
- real world
- neural network