TY  - JOUR
A1  - Rambau, Jörg
A1  - Schwarz, Cornelius
T1  - On the benefits of using NP-hard problems in Branch & Bound
N2  - 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.
KW  - Travelling-salesman-Problem
KW  - Branch-and-Bound-Methode
KW  - Reihenfolgeproblem
KW  - Routing
KW  - NP-hartes Problem
KW  - Laser-Schweißen
KW  - kombinatorische Relaxation
KW  - Rural-Postman-Problem
KW  - laser welding
KW  - combinatorial relaxation
KW  - branch-and-bound
KW  - traveling salesman problem (TSP)
KW  - rural postman problem (RPP)
Y1  - 2008
UR  - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:bvb:703-opus4-4170
UR  - http://opus4.kobv.de/opus4-ubbayreuth/frontdoor/index/index/docId/417
ER  -