Art
J-GLOBAL ID：200902136200560869   Reference number：94A0435819

Exact and Heuristic Procedures for the Traveling Salesman Problem with Precedence Constraints, Based on Dynamic Programming.

先行制約を持つ巡回セールスマン問題に対する動的計画法に基づく厳密,発見的な手続き
Author (4)：
BIANCO L

About BIANCO L

(Univ. “Tor Vergata”, Rome, ITA)

About Univ. “Tor Vergata”, Rome, ITA

, 
MINGOZZI A

About MINGOZZI A

(Univ. Bologna, ITA)

About Univ. Bologna, ITA

, 
RICCIARDELLI S

About RICCIARDELLI S

(Univ. “Tor Vergata”, Rome, ITA)

About Univ. “Tor Vergata”, Rome, ITA

, 
SPADONI M

About SPADONI M

(Univ. “La Sapienza”, Rome, ITA)

About Univ. “La Sapienza”, Rome, ITA


Material：
INFOR  (Canadian Journal of Operational Research and Information Processing)

About INFOR


Volume： 32  Issue： 1  Page： 19-32  Publication year： Feb. 1994 
JST Material Number： A0963A  ISSN： 0315-5986  Document type： Article
Article type： 原著論文  Country of issue： Canada (CAN)  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=94A0435819&from=J-GLOBAL&jstjournalNo=A0963A") }}
JST classification (1)：
JST classification
Category name(code) classified by JST.
Network methods 
(KA03040X)

About Network methods

Terms in the title (4)：
Terms in the title
Keywords automatically extracted from the title.
巡回セールスマン問題

About 巡回セールスマン問題

, 
動的計画法

About 動的計画法

, 
発見

About 発見

, 
手続き

About 手続き


Return to Previous Page

TOP

BOTTOM