On the benefits of using NP-hard problems in Branch & Bound
We present a Brand-and-Bound (B&B) method using combinatorial bounds for solving makespan minimization problems with sequence dependent setup costs. As an application we present a laser source sharing problem arising in car manufacturing.
| Institutes: | Mathematik |
|---|---|
| Author: | Jörg Rambau, Cornelius Schwarz |
| Year of Completion: | 2008 |
| SWD-Keyword: | Branch-and-Bound-Methode; NP-hartes Problem; Reihenfolgeproblem; Routing; Travelling-salesman-Problem |
| Tag: | Laser-Schweißen; Rural-Postman-Problem; kombinatorische Relaxation branch-and-bound; combinatorial relaxation; laser welding; rural postman problem (RPP); traveling salesman problem (TSP) |
| Dewey Decimal Classification: | 510 Mathematik |
| MSC-Classification: | 90B90 Case-oriented studies |
| URN: | urn:nbn:de:bvb:703-opus4-4170 |
| Document Type: | Article |
| Language: | English |
| Date of Publication (online): | 15.10.2008 |





