Rankings
Publications
Search Publications
Cited-by Search
Sources
Publishers
Scholars
Scholars
Top Cited Scholars
Organizations
About
Scilit
About Us
Advisory Board
Data Sources
Career
Support / Contact
User Guide
Publisher User
Search Function
Rankings Function
API Resource
Scilit Knowledge
Metrics
Scilit Recognitions
Publications Classification
Media
News
Blog
Login
Register
Home
Publications
Comparing Two Heuristic Local Search Algorithms for a Complex Routing Problem
Home
Publications
Comparing Two Heuristic Local Search Algorithms for a Complex Routing Problem
Comparing Two Heuristic Local Search Algorithms for a Complex Routing Problem
Authors:
PC
Pablo Cabrera-Guerrero
Pablo Cabrera-Guerrero
AM
Andrés Moltedo-Perfetti
Andrés Moltedo-Perfetti
EC
Enrique Cabrera
Enrique Cabrera
FP
Fernando Paredes
Fernando Paredes
Citation Alert
Add to Library
Cite
Download
Share
Download
Publisher website
Google Scholar
15 December 2016
journal article
Published by
ICI Bucharest
in
Studies in Informatics and Control
Vol. 25
(4)
DOI:
10.24846/v25i4y201602
Abstract
No abstract available
Cited
Cited by 3 articles
Scroll to top