The cumulative school bus routing problem: Polynomial‐size formulations
From MaRDI portal
Publication:6180039
DOI10.1002/net.22179zbMath1530.90019MaRDI QIDQ6180039
Tolga Bektaş, Unnamed Author, Jens Lysgaard
Publication date: 18 January 2024
Published in: Networks (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Linear programming (90C05) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Cites Work
- A column generation approach for a school bus routing problem with resource constraints
- A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem
- Location-routing: issues, models and methods
- A comparative analysis of several asymmetric traveling salesman problem formulations
- An effective memetic algorithm for the cumulative capacitated vehicle routing problem
- The school bus routing problem: a review
- Solving school bus routing using the multiple vehicle traveling purchaser problem: a branch-and-cut approach
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
- New mathematical models of the generalized vehicle routing problem and extensions
- The dial-a-ride problem: Models and algorithms
- A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem
- Generalized Travelling Salesman Problem Through n Sets Of Nodes: An Integer Programming Approach
- Integer Programming Formulation of Traveling Salesman Problems
- The Capacitated m-Ring-Star Problem
- Solving school bus routing problems through integer programming
- Some applications of the generalized vehicle routing problem
- The Delivery Man Problem and Cumulative Matroids
- A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
- School bus routing—a column generation approach
- Mixed integer programming formulations for the generalized traveling salesman problem with time windows
This page was built for publication: The cumulative school bus routing problem: Polynomial‐size formulations
