Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Algorithms for solving the two-criterion large-scale travelling salesman problem

From MaRDI portal
Publication:1842309
Jump to:navigation, search

zbMath0818.90127MaRDI QIDQ1842309

I. Kh. Sigal

Publication date: 15 May 1995

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)


zbMATH Keywords

large-scale travelling salesman


Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Large-scale problems in mathematical programming (90C06) Multi-objective and goal programming (90C29)


Related Items (4)

The biobjective travelling purchaser problem ⋮ Hausdorff methods for approximating the convex Edgeworth-Pareto hull in integer problems with monotone objectives ⋮ Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors. ⋮ Design and analysis of stochastic local search for the multiobjective traveling salesman problem






This page was built for publication: Algorithms for solving the two-criterion large-scale travelling salesman problem

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1842309&oldid=14218744"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 10:39.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki