Locating a cycle in a transportation or a telecommunications network

DOI10.1002/net.20170zbMath1118.90030OpenAlexW4250150436MaRDI QIDQ3593375

Inmaculada Rodríguez-Martín, Gilbert Laporte

Publication date: 20 July 2007

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20170

zbMATH Keywords

heuristicstransportationHamiltonian cyclestraveling salesman problemtelecommunicationsbranch-and-cutcycle location

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Communication networks in operations research (90B18) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Traffic problems in operations research (90B20)

Related Items (19)

Tight bounds from a path based formulation for the tree of hub location problem ⋮ Orienteering problem: a survey of recent variants, solution approaches and applications ⋮ Extensive facility location problems on networks: an updated review ⋮ Minimum‐weight subgraphs with unicyclic components and a lower‐bounded girth ⋮ A hybrid adaptive large neighborhood search heuristic for the team orienteering problem ⋮ General network design: a unified view of combined location and network design problems ⋮ Variable neighbourhood structures for cycle location problems ⋮ Pricing strategies for capacitated ring-star problems based on dynamic programming algorithms ⋮ The orienteering problem: a survey ⋮ A hybrid algorithm for the DNA sequencing problem ⋮ The traveling purchaser problem with stochastic prices: exact and approximate algorithms ⋮ Cooperation of customers in traveling salesman problems with profits ⋮ Asymmetric probabilistic minimum-cost Hamiltonian cycle problem considering arc and vertex failures ⋮ New pricing strategies and an effective exact solution framework for profit-oriented ring arborescence problems ⋮ Median and covering location problems with interconnected facilities ⋮ On path-bridge inequalities for the orienteering arc routing problems ⋮ Insertion heuristics for central cycle problems ⋮ The tree of hubs location problem ⋮ The minimum flow cost Hamiltonian cycle problem: a comparison of formulations

Uses Software

• TSPLIB
• TSPTW
• LKH

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows
• TSPLIB—A Traveling Salesman Problem Library
• An Optimal Algorithm for the Orienteering Tour Problem
• State-of-the-Art Survey—The Traveling Salesman Problem: A Neural Network Perspective
• Computer Solutions of the Traveling Salesman Problem
• Maximum matching and a polyhedron with 0,1-vertices

This page was built for publication: Locating a cycle in a transportation or a telecommunications network