The attractive traveling salesman problem
type: Item
instance of: scholarly article
title: The attractive traveling salesman problem
zbMATH Open document ID: 1176.90603
author: Güneş Erdogăn
author: Jean-François Cordeau
author: G. Laporte
published in: European Journal of Operational Research
publication date: 2009-12-07T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5643700
zbMATH Keywords: traveling salesman problem
zbMATH Keywords: demand attraction
zbMATH Keywords: demand allocation
zbMATH Keywords: linearization
zbMATH Keywords: branch-and-cut
zbMATH Keywords: tabu search
describes a project that uses: TSPLIB
MaRDI profile type: Publication
full work available at URL: j.ejor.2009.06.029
OpenAlex ID: W2138232928
cites work: On the global optimization of sums of linear fractional functions over a convex set
cites work: Solution of a fractional combinatorial optimization problem by mixed integer programming
cites work: Validating the gravity-based competitive location model using inferred attractiveness
cites work: Finding the optimal solution to the Huff based competitive location model
cites work: The gravity \(p\)-median model
cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
cites work: Solving the Orienteering Problem through Branch-and-Cut
cites work: Solving the sum-of-ratios problem by an interior-point method
cites work: Experiments in mixed-integer linear programming using pseudo-costs
cites work: The Covering Tour Problem
cites work: A tabu search heuristic for the undirected selective travelling salesman problem
cites work: New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
cites work: The orienteering problem
cites work: AN ALGORITHM FOR SINGLE CONSTRAINT MAXIMUM COLLECTION PROBLEM
cites work: The Ring Star Problem: Polyhedral analysis and exact algorithm
cites work: Locating median cycles in networks
cites work: The selective travelling salesman problem
cites work: Facet identification for the symmetric traveling salesman polytope
cites work: TSPLIB—A Traveling Salesman Problem Library
cites work: Q4833811
cites work: A note on a global approach for general 0-1 fractional programming
DOI: 10.1016/J.EJOR.2009.06.029
description: scientific article; zbMATH DE number 5643700