Multiobjective traveling salesperson problem on Halin graphs
From MaRDI portal
Publication:2378458
DOI10.1016/j.ejor.2008.04.011zbMath1161.90014OpenAlexW2070956006MaRDI QIDQ2378458
Özgür Özpeynirci, Murat M. Köksalan
Publication date: 8 January 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2008.04.011
computational complexitymultiple objectivesHalin graphstraveling salesperson problemsolvable casesBottleneck traveling salesperson problem
Related Items (7)
Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems ⋮ Extremal Halin graphs with respect to the signless Laplacian spectra ⋮ An evolutionary approach to generalized biobjective traveling salesperson problem ⋮ Pyramidal tours and multiple objectives ⋮ An interactive algorithm for multi-objective route planning ⋮ An interactive approach for biobjective integer programs under quasiconvex preference functions ⋮ The \(x\)-and-\(y\)-axes travelling salesman problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A linear time algorithm for the bottleneck traveling salesman problem on a Halin graph
- A new asymmetric pyramidally solvable class of the traveling salesman problem
- On Gilmore-Gomory's open question for the bottleneck TSP.
- A study of exponential neighborhoods for the travelling salesman problem and for the quadratic assignment problem.
- An improved upper bound for the TSP in cubic 3-edge-connected graphs
- Bicriteria Transportation Problem
- Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey
- Halin graphs and the travelling salesman problem
- Linear‐time algorithms for the 2‐connected steiner subgraph problem on special classes of graphs
This page was built for publication: Multiobjective traveling salesperson problem on Halin graphs
