MILP models of a patient transportation problem
From MaRDI portal
Publication:6661215
DOI10.1007/s10100-023-00902-zMaRDI QIDQ6661215
Martin Tóth, Adrián Horváth, Tamás Hajba
Publication date: 13 January 2025
Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- A comprehensive survey on the multiple traveling salesman problem: applications, approaches and taxonomy
- A comparative analysis of several asymmetric traveling salesman problem formulations
- Multi-directional local search for a bi-objective dial-a-ride problem in patient transportation
- Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs
- Bi-objective optimization model for the heterogeneous dynamic dial-a-ride problem with no rejects
- Improved models for a single vehicle continuous-time inventory routing problem with pickups and deliveries
- Models and algorithms for the traveling salesman problem with time-dependent service times
- A dial-a-ride problem for client transportation in a health-care organization
- Routing and scheduling field service operation by P-graph
- Integer Programming Formulation of Traveling Salesman Problems
- Solving the asymmetric travelling salesman problem with time windows by branch-and-cut
Related Items (1)
This page was built for publication: MILP models of a patient transportation problem
