Olaf E. Flippo

Learn More
In this paper a unifying framework is presented for the generalization of the decomposition methods originally developed by Benders (1962) and Dantzig and Wolfe (1960). These generalizations, called Variable Decomposition and Constraint Decomposition respectively, are based on the general duality theory developed by Tind and Wolsey. The framework presented(More)
In this paper we consider the local access telecommunication network expansion problem, in which growing demand can be satis®ed by expanding cable capacities and/or installing concentrators in the network. The problem is known to be NP-hard. We prove that the problem is weakly NP-hard, and present a pseudo-polynomial dynamic programming algorithm for the(More)
In this paper a typical situation arising in the assembly of printed circuit boards is investigated. The planning problem we face is how to assemble boards of di erent types using a single line of placement machines. From a practical viewpoint, the multiplicity of board types adds signi cantly to the complexity of the problem, which is already very hard to(More)
This paper considers the ATM Network Installation Problem on a tree. To install such a communication network, decisions concerning the location of hardware devices, the capacity installation on links, and the routing of demands have to be made simultaneously. The problem is shown to be NP-hard. By exploiting the tree structure we show that the problem can(More)
The minimization of the makespan of a printed circuit board assembly process is a complex problem. Decisions involved in this problem concern the speci cation of the order in which components are to be placed on the board, and the assignment of component types to the feeder slots of the placement machine. If some component types are assigned to multiple(More)
  • 1