ILP and CP Formulations for the Lazy Bureaucrat Problem
Lazy reformulations of classical combinatorial optimization problems are new and challenging classes of problems. In this paper we focus on the Lazy Bureaucrat Problem (LBP) which is the lazy counterpart of the knapsack problem. Given a set of tasks with a common arrival time and deadline, the goal of a lazy bureaucrat is to schedule a least profitable subset of tasks, while having an excuse that no other tasks can be scheduled without exceeding the deadline.
Three ILP formulations and their CP counterparts are studied and implemented. In addition, a dynamic programming algorithm that runs is pseudo-polynomial time and polynomial greedy heuristics are implemented and computationally compared with ILP/CP approaches. For the computational study, a large set of knapsack-type instances with various characteristics is used to examine the applicability and strength of the proposed approaches.
KeywordsInteger Linear Programming Knapsack Problem Constraint Programming Valid Inequality Critical Item
Unable to display preview. Download preview PDF.
- 7.Pisinger, D.: David Pisinger’s optimization codes (2014). http://www.diku.dk/pisinger/codes.html