Optimal Solution of the Discrete Cost Multicommodity Network Design Problem
Mrad, Mehdi . 2008
We investigate a multicommodity network design problem where a discrete set of technologies with step-increasing cost and capacity functions should be installed on the edges. This problem is a fundamental network design problem having many important applications in contemporary telecommunication networks. We describe an exact constraint generation
approach and we show that the conjunctive use of valid inequalities, bipartition inequalities that are generated using max-flow computations, as well as an exact separation algorithm of metric inequalities makes it feasible to solve to optimality instances with up to 50 nodes and 100 edges.
In this paper, we address a real-world optimization problem; the scheduling of a Bank Information Technologies (IT) staff. This problem can be defined as the process of constructing optimized work…
In this paper, we address the problem of minimizing the consumed electric energy for a personal rapid transit transportation system, in order to fulfil a planned list of trips, performed by a set…
We investigate the two-stage guillotine two-dimensional cutting stock problem. This problem commonly