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

URN to cite this document: urn:nbn:de:bvb:703-opus4-4170

Title data

Rambau, Jörg ; Schwarz, Cornelius:
On the benefits of using NP-hard problems in Branch & Bound.
Bayreuth , 2008

[img] PDF
rambau_schwarz.pdf - Published Version
Available under License Creative Commons BY 3.0: Attribution .

Download (124kB)

Abstract

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.

Further data

Item Type: Preprint, postprint
Additional notes (visible to public): msc: 90B90
Keywords: Travelling-salesman-Problem; Branch-and-Bound-Methode; Reihenfolgeproblem; Routing; NP-hartes Problem; Laser-Schweißen; kombinatorische Relaxation; Rural-Postman-Problem; laser welding; combinatorial relaxation; branch-and-bound; traveling salesman problem (TSP); rural postman problem (RPP)
DDC Subjects: 500 Science > 510 Mathematics
Institutions of the University: Faculties > Faculty of Mathematics, Physics und Computer Science > Department of Mathematics
Faculties
Faculties > Faculty of Mathematics, Physics und Computer Science
Language: English
Originates at UBT: Yes
URN: urn:nbn:de:bvb:703-opus4-4170
Date Deposited: 25 Apr 2014 10:46
Last Modified: 27 Mar 2019 13:32
URI: https://epub.uni-bayreuth.de/id/eprint/587

Downloads

Downloads per month over past year