Search Results - subject:"branch and bound"

Möglichkeiten zur wirkungsvollen Gestaltung von Branch and Bound-Verfahren : dargestellt an ausgewählten Problemen der Reihenfolgeplanung

Liesegang, Günter - 1974

Persistent link: https://www.econbiz.de/10000112809

Ein effizientes Branch und Bound Verfahren zur Lösung des asymmetrischen Problems des Handlungsreisenden

Schönlein, Alfred - 1974

Persistent link: https://www.econbiz.de/10000112823

An efficient branch and bound algorithm for warehouse location

Khumawala, Basheer Ahmed Mohammed Umer - 1970

Persistent link: https://www.econbiz.de/10002209984

An algorithm for the generalized transportation problem

MacKinnon, James G. - 1975

Persistent link: https://www.econbiz.de/10002259242

Die Lösung von Reihenfolgeproblemen aus dem Bereich der Maschinenbelegungsplanung mit Hilfe des Branch and Bound Algorithmus

Rubow, Gerhard - 1969

Persistent link: https://www.econbiz.de/10013310884

Einführung in die Methode branch and bound : Unterlagen für einen Kurs des Instituts für Operations Research der ETH Zürich

Weinberg, Franz (ed.) - 1968

Persistent link: https://www.econbiz.de/10013278071

Project scheduling with discrete time-resource and resource-resource tradeoffs

Sprecher, Arno; Hartmann, Sönke; Drexl, Andreas - 1994

generalization of the branch-and-bound algorithm proposed by Demeulemeester and Herroelen, which is currently the most powerful …

Persistent link: https://www.econbiz.de/10011613753

Project scheduling with discrete time-resource and resource-resource tradeoffs

Sprecher, Arno; Hartmann, Sönke; Drexl, Andreas - 1994

generalization of the branch-and-bound algorithm proposed by Demeulemeester and Herroelen, which is currently the most powerful …

Persistent link: https://www.econbiz.de/10011743239

Semi-active, active and non-delay schedules for the resource-constrained project scheduling problem

Sprecher, Arno; Kolisch, Rainer; Drexl, Andreas - 1993

We consider the resource-constrained project scheduling problem (RCPSP). The focus of the paper is on a formal definition of semi-active, active, and non-delay schedules. Traditionally these schedules establish basic concepts within the job shop scheduling literature. There they are usually...

Persistent link: https://www.econbiz.de/10011613723

Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem

Sprecher, Arno; Kolisch, Rainer; Drexl, Andreas - 1993

Persistent link: https://www.econbiz.de/10011738660