Approximation algorithms for a sequencing problem with a biased bipartite structure
Given a family of m + 1 sets of n vertices in a metric space, a bi-level optimization problem to be considered in this paper asks to find a minimum cost repetitive walk with a prescribed terminal vertex. The bi-level optimization problem is inspired by an industrial application in the printed circui...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
The Japan Society of Mechanical Engineers
2016-07-01
|
| Series: | Journal of Advanced Mechanical Design, Systems, and Manufacturing |
| Subjects: | |
| Online Access: | https://www.jstage.jst.go.jp/article/jamdsm/10/3/10_2016jamdsm0045/_pdf/-char/en |