Titlebar

Export bibliographic data
Literature by the same author
plus on the publication server
plus at Google Scholar

 

On the benefits of using NP-hard problems in Branch & Bound

Title data

Rambau, Jörg ; Schwarz, Cornelius:
On the benefits of using NP-hard problems in Branch & Bound.
In: Fleischmann, Bernhard ; Borgwardt, Karl Heinz ; Klein, Robert ; Tuma, Axel (Hrsg.): Selected papers of the annual international conference of the German Operations Research Society (GOR). - Berlin : Springer , 2009 . - pp. 463-468 . - (Operations Research Proceedings ; 2008 )
ISBN 978-3-642-00141-3

Abstract in another language

We present a Branch-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.

Further data

Item Type: Article in a book
Refereed: Yes
Institutions of the University: Faculties
Faculties > Faculty of Mathematics, Physics und Computer Science
Faculties > Faculty of Mathematics, Physics und Computer Science > Department of Mathematics
Faculties > Faculty of Mathematics, Physics und Computer Science > Department of Mathematics > Chair Mathematics in Economy > Chair Mathematics in Economy - Univ.-Prof. Dr. Jörg Rambau
Faculties > Faculty of Mathematics, Physics und Computer Science > Department of Mathematics > Chair Mathematics in Economy
Result of work at the UBT: Yes
DDC Subjects: 500 Science > 510 Mathematics
Date Deposited: 04 Jun 2014 08:39
Last Modified: 08 Jun 2016 07:22
URI: https://eref.uni-bayreuth.de/id/eprint/747