Solving standard traveling salesman problem and multiple traveling salesman problem by using branch-and-bound
Link to publisher's homepage at http://scitation.aip.org
Saved in:
Main Authors: | Shakila, Saad, Wan Nurhadani, Wan Jaafar, Siti Jasmida, Jamil |
---|---|
Other Authors: | shakila@unimap.edu.my |
Format: | Article |
Language: | English |
Published: |
AIP Publishing LLC
2014
|
Subjects: | |
Online Access: | http://dspace.unimap.edu.my:80/dspace/handle/123456789/35164 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Route of UniMAP’s shuttle bus: Optimization
by: Nor Hazadura, Hamzah, et al.
Published: (2010) -
An efficient approach for traveling salesman problem solution with branch-and-bound
by: Mustafa, Mamat, et al.
Published: (2016) -
Solving traveling salesman problems using branch and bound methods
by: Mustafa, Mamat, et al.
Published: (2019) -
The retrace traveling salesman problem : a new extension of traveling salesman problem
by: Arbain, Juraidawati
Published: (2003) -
Solving the travelling salesman problem by using artificial bee colony algorithm / Noor Ainul Hayati Mohd Naziri
by: Mohd Naziri, Noor Ainul Hayati
Published: (2021)