Tree of Logical Possibilities and its Application in Logistic

Dominika Crnjac Milic ()
Additional contact information
Dominika Crnjac Milic: Faculty of Electrical Engineering, Osijek, Croatia

Business Logistics in Modern Management, 2009, vol. 9, 265-270

Abstract: Knowing that until today has not been known effective algorithm for solving the traveling salesman problem we aim to give a certain contribution in this direction. The more we give some results in determining the shortest time and storage

Keywords: node; path; tree; cycle; Cartesian graph. (search for similar items in EconPapers)
Date: 2009
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.efos.unios.hr/repec/osi/bulimm/PDF/Busi ... ment09/blimm0921.pdf (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:osi:bulimm:v:9:y:2009:p:265-270

Access Statistics for this article

More articles in Business Logistics in Modern Management from Josip Juraj Strossmayer University of Osijek, Faculty of Economics, Croatia Contact information at EDIRC.
Bibliographic data for series maintained by Davor Dujak,PhD ( this e-mail address is bad, please contact ).