Refine
Year of publication
- 2008 (1) (remove)
Language
- English (1) (remove)
Keywords
- Branch-and-Bound-Methode (1)
- Laser-Schweißen (1)
- NP-hartes Problem (1)
- Reihenfolgeproblem (1)
- Routing (1)
- Rural-Postman-Problem (1)
- Travelling-salesman-Problem (1)
- branch-and-bound (1)
- combinatorial relaxation (1)
- kombinatorische Relaxation (1)
-
On the benefits of using NP-hard problems in Branch & Bound
(2008)
- 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.
