A branch-and-price algorithm for placement routing for a multi-head beam-type component placement tool
Year of publication: |
2008
|
---|---|
Authors: | Sun, Dong-Seok ; Lee, Tae-Eog |
Published in: |
OR spectrum : quantitative approaches in management. - Berlin : Springer, ISSN 0171-6468, ZDB-ID 2073885-7. - Vol. 30.2008, 3, p. 515-534
|
Subject: | Branch-and-Bound | Branch and Bound | Tourenplanung | Vehicle routing problem | Automatisierte Produktion | Automated manufacturing | Operations Research | Operations research |
-
JD.com : operations research algorithms drive intelligent warehouse robots to work
Qin, Hengle, (2022)
-
Minimizing delays in a shunting yard
Jaehn, Florian, (2015)
-
A new branch-and-bound algorithm for the maximum edge-weighted clique problem
San Segundo, Pablo, (2019)
- More ...
-
Sun, Dong-Seok, (2005)
-
Sun, Dong-Seok, (2008)
-
A three-level supply chain network design model with risk-pooling and lead times
Park, Sukun, (2010)
- More ...