On symmetric subtour problems
type: Item
instance of: scholarly article
title: On symmetric subtour problems
zbMATH Open document ID: 0762.90059
DOI: 10.1007/BF03167273
author: Mikio Kubo
author: Hiroshi Kasugai
published in: Japan Journal of Industrial and Applied Mathematics
publication date: 1993-02-16T00:00:00Z
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 52B12
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C11
zbMATH DE Number: 109305
zbMATH Keywords: traveling salesman
zbMATH Keywords: valid inequalities
zbMATH Keywords: facets
zbMATH Keywords: polytope of the subtour problem
describes a project that uses: VRP
MaRDI profile type: Publication
cites work: The prize collecting traveling salesman problem
cites work: Edmonds polytopes and weakly hamiltonian graphs
cites work: The maximum covering/shortest path problem: A multiobjective network design and routing formulation
cites work: The Median Shortest Path Problem: A Multiobjective Approach to Analyze Cost vs. Accessibility in the Design of Transportation Networks
cites work: The Covering Salesman Problem
cites work: Q3844775
cites work: Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
cites work: Maximum matching and a polyhedron with 0,1-vertices
cites work: Q3475129
cites work: Q3686412
cites work: Facets of the Asymmetric Traveling Salesman Polytope
cites work: Q4205235
cites work: An Additive Bounding Procedure for Combinatorial Optimization Problems
cites work: Q4198056
cites work: Q3343723
cites work: The orienteering problem
cites work: Q3795496
cites work: On the symmetric travelling salesman problem I: Inequalities
cites work: Clique Tree Inequalities and the Symmetric Travelling Salesman Problem
cites work: AN ALGORITHM FOR SINGLE CONSTRAINT MAXIMUM COLLECTION PROBLEM
cites work: RANDOMIZED DECISION STRATEGY FOR THE HIERARCHICAL OPTIMIZATION PROBLEMS
cites work: THE PRECEDENCE CONSTRAINED TRAVELING SALESMAN PROBLEM
cites work: Q3677509
cites work: Integer Programming Formulation of Traveling Salesman Problems
cites work: Classification of travelling salesman problem formulations
cites work: Generalized Subtour Elimination Constraints and Connectivity Constraints
cites work: The selective travelling salesman problem
cites work: Approximate algorithms for the travelling purchaser problem
cites work: A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
description: scientific article; zbMATH DE number 109305