An exact approach for the 0–1 Knapsack Problem with Setups

We consider the 0–1 Knapsack Problem with Setups. We propose an exact approach which handles the structure of the ILP formulation of the problem. It relies on partitioning the variables set into two levels and exploiting this partitioning. The proposed approach favorably compares to the algorithms in literature and to solver CPLEX 12.5 applied to … Read more

The Multi-Hour Bandwidth Packing Problem with Queuing Delays: Bounds and Exact Solution Approach

The multi-hour bandwidth packing problem arises in telecommunication networks that span several time horizon. The problem seeks to select and route a set of messages from a given list of messages with prespecified requirement on demand for bandwidth under time varying traffic conditions on an undirected communication network such that the total profit is maximized. … Read more