The m-CPSP consists of determining m Hamiltonian cycles of least total cost on G such that no edge e ∈ E is used more than Ce times. To avoid trivial or ...
The undirected m-Capacitated Peripatetic Salesman Problem (m-CPSP) is defined on a complete simple graph G = (V,E), where V = {1,...,n} is the vertex set ...
The Undirected m-Peripatetic Salesman Problem: Polyhedral ...
pubsonline.informs.org › opre.1070.0387
In the m-peripatetic salesman problem (m-PSP), the aim is to determine m edge disjoint Hamiltonian cycles of minimum total cost on a graph.
Jun 24, 2024 · It is an NP-hard optimization problem arising in routing and telecommunications. In this article the PCLP is formulated as an integer linear ...
In the m -peripatetic salesman problem ( m -PSP), the aim is to determine m edge disjoint Hamiltonian cycles of minimum total cost on a graph. This article ...
In the m-peripatetic salesman problem (m-PSP), the aim is to determine m edge disjoint Hamiltonian cycles of minimum total cost on a graph.
New valid inequalities and polyhedral results for the m-PSP are introduced and an improved 2-index branch-and-cut algorithm is developed that can solve ...
The undirected m-Capacitated Peripatetic Salesman Problem ; European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID ...
This work considers the minimization and maximization 2-CPSP with edge weights chosen from an integer segment {1, q} with the edges capacities given as ...
In the m-Capacitated Peripatetic Salesman Problem (m-CPSP) the aim is to determine in Hamiltonian cycles of minimal total cost on a graph, such that all the ...