Peng-Yeng Yin

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Bertrand M. T. Lin

> Home > Persons > Peng-Yeng Yin

Publications

2013
[j42]
- view
  authority control:
- export record
  dblp key:
  - journals/amc/LinYL13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/amc/LinYL13
Bertrand M. T. Lin, Peng-Yeng Yin, Y. S. Liu:
Sequence-dependent scheduling with order deliveries. Appl. Math. Comput. 222: 58-71 (2013)
2004
[j19]
- view
  authority control:
- export record
  dblp key:
  - journals/anor/ShyuYL04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/anor/ShyuYL04
Shyong Jian Shyu, Peng-Yeng Yin, Bertrand M. T. Lin:
An Ant Colony Optimization Algorithm for the Minimum Weight Vertex Cover Problem. Ann. Oper. Res. 131(1-4): 283-304 (2004)
[j18]
- view
  authority control:
- export record
  dblp key:
  - journals/candie/ShyuLY04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/candie/ShyuLY04
Shyong Jian Shyu, Bertrand M. T. Lin, Peng-Yeng Yin:
Application of ant colony optimization for no-wait flowshop scheduling problem to minimize the total completion time. Comput. Ind. Eng. 47(2-3): 181-193 (2004)
2003
[j16]
- view
  authority control:
- export record
  dblp key:
  - journals/jetai/ShyuYLH03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jetai/ShyuYLH03
Shyong Jian Shyu, Peng-Yeng Yin, Bertrand M. T. Lin, Mohamed Haouari:
Ant-Tree: an ant colony optimization approach to the generalized minimum spanning tree problem. J. Exp. Theor. Artif. Intell. 15(1): 103-112 (2003)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.