Integer programming formulations for the k-edge-connected 3-hop-constrained network design problem
Texte intégral
Figure
Documents relatifs
Keywords periodic scheduling, resource-constrained modulo scheduling, in- teger linear programming formulations, lower bounds, column generation..
For the balanced assignment problem and the balanced subset problem, the result tables are similar to the balanced TSP (i.e. time to optimal with the lifted formulation and the
The sensors will transmit their information accord- ing to a many-to-one traffic pattern using a multihop scheme. Moreover, the length of every corona can be varied. For each zone
Our first branch-and-cut algorithm, bc-all, checks for violated Benders cuts (7) at every node of the tree, while it tests for violated inequality (8) only at integer nodes.. As
However, for hard instances with a considerable number of disjunctions, such as the instances with 10 tasks and 3 machines, the execution times of the MILP rocket up and it is
The principle of the algorithm used here is to solve a fixed charge net- work design problem (without the shortest path constraints) by a branch- and-bound procedure and to add
The benchmark instances for the CC problem were easily solved to optimality by an ILP formulation (denoted IP(CC)) usually used in the literature for graph clustering
The purpose of the paper is therefore to propose a practical methodology by linking these tools together: by describing the controller using a truncation of the Youla