The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm
From MaRDI portal
Publication:6179711
DOI10.1002/net.22124zbMath1529.90079OpenAlexW4293788476MaRDI QIDQ6179711
Tommaso Pastore, Serena Fugaro, Paola Festa, Daniele Ferone
Publication date: 18 December 2023
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.22124
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On an exact method for the constrained shortest path problem
- Solving resource constrained shortest path problems with LP-based methods
- An improved approximation algorithm for the clustered traveling salesman problem
- A tabu search heuristic for the generalized minimum spanning tree problem
- Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem
- A reoptimization algorithm for the shortest path problem with time windows
- Class Steiner trees and VLSI-design
- Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem
- The class Steiner minimal tree problem: A lower bound and test problem generation
- GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem
- Combined column-and-row-generation for the optimal communication spanning tree problem
- An enhanced K-SP algorithm with pruning strategies to solve the constrained shortest path problem
- A hybrid particle swarm optimization -- variable neighborhood search algorithm for constrained shortest path problems
- A three-stage approach for the resource-constrained shortest path as a sub-problem in column generation
- Generalized network design problems.
- Resource constrained shortest path problems in path planning for fleet management
- Enumerating \(K\) best paths in length order in DAGs
- An efficient transformation of the generalized vehicle routing problem
- A dynamic programming algorithm for solving the \(k\)-color shortest path problem
- Shortest path tour problem with time windows
- The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances
- On the clustered Steiner tree problem
- On the minimum routing cost clustered tree problem
- Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem
- Resource extension functions: properties, inversion, and generalization to segments
- A survey of resource constrained shortest path problems: Exact solution approaches
- An exact bidirectionalA⋆approach for solving resource-constrained shortest path problems
- Decomposition Principle for Linear Programs
- Plus court chemin avec contraintes d'horaires
- A novel genetic algorithm for solving the clustered shortest-path tree problem
- New dynamic programming algorithms for the resource constrained elementary shortest path problem
- A dual algorithm for the constrained shortest path problem
- A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
- Improved preprocessing, labeling and scaling algorithms for the Weight-Constrained Shortest Path Problem
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
- On the generalized minimum spanning tree problem
- The shortest path with at most / nodes in each of the series/parallel clusters
- The symmetric generalized traveling salesman polytope
- Selected Topics in Column Generation
- Shortest Path Problems with Resource Constraints
- A column generation approach for the split delivery vehicle routing problem
- On generalized minimum spanning trees
This page was built for publication: The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm
