Abstract. This paper introduces a problem called the temporal knapsack problem, presents several algorithms for solving it, and compares their performance. The temporal knapsack pr...
Mark Bartlett, Alan M. Frisch, Youssef Hamadi, Ian...
The combination of process integration and Operations Research enables an integrated technique assessment and a subsequent process design. The application of Multi Objective Pinch...
Jutta Geldermann, Hannes Schollenberger, Martin Tr...
Abstract. Logic-based Benders decomposition can combine mixed integer programming and constraint programming to solve planning and scheduling problems much faster than either metho...
In order to support verification, validation and analysis of dynamic Operations Research (OR) models a method of testing models against data is required. In the case of the QCM qu...
Abstract. We present a theoretical study on the idea of using mathematical programming relaxations for filtering binary constraint satisfaction problems. We introduce the consisten...
Ionut D. Aron, Daniel H. Leventhal, Meinolf Sellma...