//--> //--> //-->
Toggle navigation
Logout
Change account settings
EN
DE
ES
FR
A-Z
Beta
About EconBiz
News
Thesaurus (STW)
Academic Skills
Help
EN
DE
ES
FR
My account
Logout
Change account settings
Login
Publications
Events
Your search terms
Search
Search options
All Fields
Title
Exact title
Subject
Author
Institution
ISBN/ISSN
Published in...
Publisher
Open Access only
Advanced
Search history
My EconBiz
Favorites
Loans
Reservations
Fines
You are here:
Home
Search: subject:"Euclidean traveling salesman problem"
Narrow search
Narrow search
Year of publication
From:
To:
Subject
All
Class association rules
1
Euclidean traveling salesman problem
1
Large-scale optimization
1
Metaheuristics
1
Supervised learning
1
Online availability
All
Undetermined
1
Type of publication
All
Article
1
Language
All
Undetermined
1
Author
All
Chan, C.
1
Cheung, C.
1
Ip, W.
1
Xue, Fan
1
Published in...
All
Netnomics
1
Source
All
RePEc
1
Showing
1
-
1
of
1
Sort
relevance
articles prioritized
date (newest first)
date (oldest first)
1
A learning-based variable assignment weighting scheme for heuristic and exact searching in Euclidean traveling salesman problems
Xue, Fan
;
Chan, C.
;
Ip, W.
;
Cheung, C.
- In:
Netnomics
12
(
2011
)
3
,
pp. 183-207
methods can therefore test promising solutions first. The
Euclidean
Traveling
Salesman
Problem
(ETSP) is employed as an …
Persistent link: https://www.econbiz.de/10010862873
Saved in:
Results per page
10
25
50
100
250
A service of the
zbw
×
Loading...
//-->