Locating a cycle in a transportation or a telecommunications network

DOI10.1002/NET.20170MaRDI QIDQ3593375zbMATH OpenOpenAlexFDO

Authors G. Laporte, Inmaculada Rodríguez-Martín

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

heuristicstransportationtraveling salesman problembranch-and-cutHamiltonian cyclestelecommunicationscycle location

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1323023
• Locating median cycles in networks
• Exact and heuristic approaches for the cycle hub location problem
• Minisum location of a travelling salesman on simple networks
• Some Applications of the Generalized Travelling Salesman Problem

Cites work

• scientific article; zbMATH DE number 2064412 (Why is no real title available?)
• scientific article; zbMATH DE number 2064416 (Why is no real title available?)
• scientific article; zbMATH DE number 2064417 (Why is no real title available?)
• scientific article; zbMATH DE number 1749228 (Why is no real title available?)
• scientific article; zbMATH DE number 3895002 (Why is no real title available?)
• scientific article; zbMATH DE number 956787 (Why is no real title available?)
• A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows
• An Optimal Algorithm for the Orienteering Tour Problem
• Computer Solutions of the Traveling Salesman Problem
• Maximum matching and a polyhedron with 0,1-vertices
• State-of-the-Art Survey—The Traveling Salesman Problem: A Neural Network Perspective
• TSPLIB—A Traveling Salesman Problem Library

Cited in

(21)

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

Describes a project that uses

Uses Software

• LKH
• TSPTW
• TSPLIB

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3593375)