Amanote Research

Amanote Research

    RegisterSign In

Fixed-Parameter Algorithms for Rectilinear Steiner Tree and Rectilinear Traveling Salesman Problem in the Plane

European Journal of Operational Research - Netherlands
doi 10.1016/j.ejor.2018.03.042
Full Text
Open PDF
Abstract

Available in full text

Categories
Information SystemsSimulationManagement ScienceManagementComputer ScienceModelingOperations Research
Date

October 1, 2018

Authors
Hadrien CambazardNicolas Catusse
Publisher

Elsevier BV


Related search

Obstacle-Avoiding Rectilinear Steiner Tree Construction

2008English

The Rectilinear Steiner Ratio

ORiON
2005English

Exact Algorithms for the Equitable Traveling Salesman Problem

SSRN Electronic Journal
2016English

Worst-Case Minimum Rectilinear Steiner Trees in All Dimensions

Discrete and Computational Geometry
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
1992English

Polynomial-Space Exact Algorithms for the Bipartite Traveling Salesman Problem

IEICE Transactions on Information and Systems
Electronic EngineeringPattern RecognitionHardwareComputer VisionElectricalArchitectureArtificial IntelligenceSoftware
2018English

UML Modeling for Traveling Salesman Problem Based on Genetic Algorithms

Southeast Europe Journal of Soft Computing
2012English

Traveling Salesman Algorithms Complexity

International Journal of Computer Applications
2019English

The Traveling Salesman Problem

English

Traveling Salesman Problem

2011English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy