Metaheuristics for the asymmetric Hamiltonian path problem

DOI10.1007/978-3-642-18466-6_32MaRDI QIDQ3075277zbMATH OpenOpenAlexFDO

Authors João Pedro Pedroso

Publication date 11 February 2011

Published in Numerical Methods and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-18466-6_32

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• scientific article; zbMATH DE number 4152160
• A note on exploiting the Hamiltonian cycle problem substructure of the asymmetric traveling salesman problem
• scientific article; zbMATH DE number 2162233
• scientific article; zbMATH DE number 1703863
• scientific article; zbMATH DE number 870411

Cites work

• scientific article; zbMATH DE number 2064413 (Why is no real title available?)
• Integer Programming Formulation of Traveling Salesman Problems

Describes a project that uses

Uses Software

• Gurobi
• TSPLIB

This page was built for publication: Metaheuristics for the asymmetric Hamiltonian path problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3075277)