Locating median cycles in networks
type: Item
instance of: scholarly article
title: Locating median cycles in networks
zbMATH Open document ID: 1067.90109
author: Martine Labbé
author: G. Laporte
author: Inmaculada Rodríguez-Martín
author: Juan-José Salazar-González
published in: European Journal of Operational Research
publication date: 2004-11-22T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 2117517
zbMATH Keywords: Integer programming
zbMATH Keywords: Location
zbMATH Keywords: Routing
zbMATH Keywords: Travelling salesman
describes a project that uses: ABACUS
describes a project that uses: TSPLIB
MaRDI profile type: Publication
full work available at URL: j.ejor.2003.07.010
OpenAlex ID: W2081248050
cites work: The prize collecting traveling salesman problem
cites work: The Circuit Polytope: Facets
cites work: The median tour and maximal covering tour problems: Formulations and heuristics
cites work: The Median Shortest Path Problem: A Multiobjective Approach to Analyze Cost vs. Accessibility in the Design of Transportation Networks
cites work: A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
cites work: Solving the Orienteering Problem through Branch-and-Cut
cites work: Q4461915
cites work: The Covering Tour Problem
cites work: Q4540081
cites work: Q3147665
cites work: Locating A Median Subtree On A Network
cites work: Q5689811
cites work: Q4955272
cites work: The optimal location of a path or tree in a tree network
cites work: On finding the core of a tree with a specified length
cites work: Lifted cover facets of the 0-1 knapsack polytope with GUB constraints
cites work: TSPLIB—A Traveling Salesman Problem Library
cites work: Optimal location of a path or tree on a network with cycles
cites work: Valid inequalities for 0-1 knapsacks and MIPs with generalised upper bound constraints
cites work: Optimizing a Ring-Based Private Line Telecommunication Network Using Tabu Search
DOI: 10.1016/J.EJOR.2003.07.010
description: scientific article; zbMATH DE number 2117517