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

Computational implementation of a combined branch and bound algorithm for the travelling-salesman problem

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

DOI10.1016/0041-5553(86)90106-0zbMath0621.90090OpenAlexW2167068511MaRDI QIDQ3758578

I. Kh. Sigal

Publication date: 1986

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

Full work available at URL: https://doi.org/10.1016/0041-5553(86)90106-0


zbMATH Keywords

combined algorithmcomputer implementationtraveling-salesman


Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Integer programming (90C10) Combinatorial optimization (90C27)








This page was built for publication: Computational implementation of a combined branch and bound algorithm for the travelling-salesman problem

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