Výsledky vyhľadávania - "LIFO implicit enumeration algorithm"

A LIFO implicit enumeration algorithm for the asymmetric travelling salesman problem using a one-arborescence relaxation

Autori: Theunis H. C. Smith

Zdroj: Mathematical Programming Studies ISBN: 9783642008016

Predmety: algorithmic performance analysis, Specification and verification (program logics, model checking, etc.), Numerical mathematical programming methods, asymmetric travelling salesman problem, LIFO implicit enumeration algorithm, one-arborescence relaxation, Integer programming, comparison of algorithms

Popis súboru: application/xml

Prístupová URL adresa: https://zbmath.org/3679547
https://doi.org/10.1007/bfb0120889
https://rd.springer.com/chapter/10.1007/BFb0120889
https://apps.dtic.mil/sti/pdfs/ADA019800.pdf
https://link.springer.com/chapter/10.1007/BFb0120889