Asymmetric probabilistic minimum-cost Hamiltonian cycle problem considering arc and vertex failures
From MaRDI portal
Publication:6109290
DOI10.1016/j.cor.2022.106084MaRDI QIDQ6109290
Publication date: 4 July 2023
Published in: Computers \& Operations Research (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Vehicle routing problem with stochastic travel times including soft time windows and service costs
- Prepositioning supplies in preparation for disasters
- A stochastic dynamic traveling salesman problem with hard time windows
- The vehicle routing problem: An overview of exact and approximate algorithms
- A generalized variable neighborhood search heuristic for the capacitated vehicle routing problem with stochastic service times
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
- Further results on the probabilistic traveling salesman problem
- Time-dependent asymmetric traveling salesman problem with time windows: properties and an exact algorithm
- Estimation-Based Local Search for Stochastic Combinatorial Optimization Using Delta Evaluations: A Case Study on the Probabilistic Traveling Salesman Problem
- Vehicle Routing
- Vehicle Routing with Stochastic Demands: Properties and Solution Frameworks
- Solving the Connected Dominating Set Problem and Power Dominating Set Problem by Integer Programming
- Integer Programming Formulation of Traveling Salesman Problems
- Recent Developments in Dynamic Vehicle Routing Systems
- Online Vehicle Routing Problems: A Survey
- Locating a cycle in a transportation or a telecommunications network
- An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
- Finding the Optimal a Priori Tour and Location of a Traveling Salesman with Nonhomogeneous Customers
- TSPLIB—A Traveling Salesman Problem Library
- A Priori Optimization of the Probabilistic Traveling Salesman Problem
- Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
- An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
- Shortest Path Problems with Resource Constraints
- A Priori Optimization
- Solving the asymmetric travelling salesman problem with time windows by branch-and-cut
- A Vehicle Routing Problem with Stochastic Demand
This page was built for publication: Asymmetric probabilistic minimum-cost Hamiltonian cycle problem considering arc and vertex failures
