The travelling salesman problem with positional consistency constraints: an application to healthcare services

DOI10.1016/j.ejor.2022.11.050OpenAlexW4310192074MaRDI QIDQ6167660

Luís Gouveia, Mafalda Ponte, Ana Paias

Publication date: 10 July 2023

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2022.11.050

zbMATH Keywords

travelling salesman problemcombinatorial optimisationhealthcare servicespositional consistency

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Branch-and-cut algorithms for the split delivery vehicle routing problem
• A branch-and-cut framework for the consistent traveling salesman problem
• A bi-objective home care scheduling problem: analyzing the trade-off between costs and client inconvenience
• Natural and extended formulations for the time-dependent traveling salesman problem
• Lower bounds for the mixed capacitated arc routing problem
• A classification of formulations for the (time-dependent) traveling salesman problem
• Layered graph approaches for combinatorial optimization problems
• Vehicle Routing
• Models for optimal survivable routing with a minimum number of hops: comparing disaggregated with aggregated models
• Integer Programming Formulation of Traveling Salesman Problems
• The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
• Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints
• Technical Note—An n-Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem
• A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem

This page was built for publication: The travelling salesman problem with positional consistency constraints: an application to healthcare services