The "branch-and-bound" algorithm for the exact solution of a three-machine scheduling problem proposed by Lomnicki has been generalized to the case of an arbitrary number of machines (under the ...

This repository contains code relating to the paper "A Combinatorial Branch-and-Bound Algorithm for the Capacitated Facility Location Problem under Strict Customer Preferences" by Christina Büsing, ...

This paper considers a production planning problem in disassembly systems, which is the problem of determining the quantity and timing of disassembling end-of-use/life products in order to satisfy the ...

Abstract: A timed Petri net (TPN) has been widely used for modeling, scheduling, and analyzing discrete event dynamic systems. This study examines cyclic scheduling problems of a TPN to minimize the ...

ABSTRACT: For solving assignment problems of staff, equipment and task in engineering support action, a 3-Dimensional assignment model is established, which contains staff skill level, equipment ...

Abstract: Graphical symbol spotting and retrieval in document images is an important sub-field in document analysis. This paper presents a branch and bound algorithm for spotting a queried graphical ...

This example illustrates a nonstandard use of PROC NETDRAW. The TREE option in PROC NETDRAW is used to draw a branch and bound tree such as one that you obtain in the solution of an integer ...