Art
J-GLOBAL ID：200902027129954989   Reference number：86A0112719

An algorithm for the traveling salesman problem with pickup and delivery customers.

配達依頼人-荷受人の関係を満たす巡回セールスマン問題のアルゴリズム
Author (3)：
KALANTARI B

About KALANTARI B

(Rutgers Univ., NJ)

About Rutgers Univ., NJ

, 
HILL A V

About HILL A V

(Univ. Minnesota)

About Univ. Minnesota

, 
ARORA S R

About ARORA S R

(Univ. Minnesota)

About Univ. Minnesota


Material：
European Journal of Operational Research  (Eur J Oper Res)

About European Journal of Operational Research


Volume： 22  Issue： 3  Page： 377-386  Publication year： Dec. 1985 
JST Material Number： A0547A  ISSN： 0377-2217  Document type： Article
Article type： 原著論文  Country of issue： Netherlands (NLD)  Language： ENGLISH (EN)
Thesaurus term：
Thesaurus term/Semi thesaurus term
Keywords indexed to the article.
All keywords is available on JDreamIII(charged).
On J-GLOBAL, this item will be available after more than half a year after the record posted. In addtion, medical articles require to login to MyJ-GLOBAL.
traveling salesman problem

About traveling salesman problem

,...
   To see more with JDream III (charged).   {{ this.onShowAbsJLink("http://jdream3.com/lp/jglobal/index.html?docNo=86A0112719&from=J-GLOBAL&jstjournalNo=A0547A") }}
JST classification (1)：
JST classification
Category name(code) classified by JST.
Network methods 
(KA03040X)

About Network methods

Terms in the title (5)：
Terms in the title
Keywords automatically extracted from the title.
配達

About 配達

, 
依頼人

About 依頼人

, 
荷受

About 荷受

, 
巡回セールスマン問題

About 巡回セールスマン問題

, 
アルゴリズム

About アルゴリズム


Return to Previous Page

TOP

BOTTOM