Tabu Search を用いた無閉路有向グラフ系列分割問題の近似解法 = Approximation Algorithm for Optimal Sequential Partitions of Directed Acyclic Graphs using Tabu Search

Taichi Kaji

商学討究 (Shogaku Tokyu), 1995, vol. 46, issue 1, 125-141

Date: 1995
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ota:ecorev:10252/1253

Access Statistics for this article

More articles in 商学討究 (Shogaku Tokyu) from Otaru University of Commerce Contact information at EDIRC.
Bibliographic data for series maintained by Miura, Chiho ().