Traveling salesman problem under categorization
From MaRDI portal
Publication:1200771
DOI10.1016/0167-6377(92)90069-FzbMath0768.90077OpenAlexW3123213514MaRDI QIDQ1200771
Publication date: 16 January 1993
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(92)90069-f
Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)
Related Items
A fast and simple algorithm for the bottleneck biconnected spanning subgraph problem ⋮ Categorized bottleneck-minisum path problems on networks ⋮ On discrete optimization with ordering ⋮ Minmax combinatorial optimization ⋮ The Complexity of Bottleneck Labeled Graph Problems ⋮ Labeled traveling salesman problems: complexity and approximation ⋮ Minimizing the number of workers in a paced mixed-model assembly line ⋮ Ordered weighted average optimization in multiobjective spanning tree problem ⋮ The complexity of bottleneck labeled graph problems ⋮ Unnamed Item ⋮ A linear time algorithm for the bottleneck biconnected spanning subgraph problem ⋮ Erratum on: Travelling salesman problem under categorization
Cites Work
- Unnamed Item
- Unnamed Item
- Guaranteed performance heuristics for the bottleneck traveling salesman problem
- Steiner problem in Halin networks
- Linear time algorithms for NP-hard problems restricted to partial k- trees
- Minmax linear programmes with grouped variables
- Group centre and group median of a network
- Minimum perfect bipartite matchings and spanning trees under categorization
- Bottleneck assignment problems under categorization
- The square of every two-connected graph is Hamiltonian
- The traveling salesman problem: An update of research
- Some Generalisations of the Time Minimising Assignment Problem
- The Bottleneck Traveling Salesman Problem
- A mofified gub algorithm for solving linear minimax problems
- Halin graphs and the travelling salesman problem
