Iterative improvement approaches for collecting weighted items in directed bipartite graphs
In this paper, an iterative improvement heuristic based on the simulated annealing is designed for a weighted item collecting problem in directed bipartite graphs. The weighted item collecting problem is a generalization of an integrated circuit design problem, and it is also a variant of 0-1 knapsa...
Main Authors: | Yoshiyuki KARUNO, Seiya TANAKA |
---|---|
Format: | Article |
Language: | English |
Published: |
The Japan Society of Mechanical Engineers
2018-05-01
|
Series: | Journal of Advanced Mechanical Design, Systems, and Manufacturing |
Subjects: | |
Online Access: | https://www.jstage.jst.go.jp/article/jamdsm/12/2/12_2018jamdsm0051/_pdf/-char/en |
Similar Items
-
Cooperative item collecting problems in directed bipartite structures
by: Yoshiyuki KARUNO, et al.
Published: (2017-06-01) -
Cyclability in bipartite graphs
by: Denise Amar, et al.
Published: (2009-01-01) -
Chromaticity of Certain Bipartite Graphs
by: Hasni @ Abdullah, Roslan
Published: (2005) -
Size Ramsey number of bipartite graphs and bipartite Ramanujan graphs
by: Ramin Javadi, et al.
Published: (2019-06-01) -
The Bipartite-Splittance of a Bipartite Graph
by: Yin Jian-Hua, et al.
Published: (2019-02-01)