solving mip
Symmetry and Search in a Network Design Problem
White Paper In both the MIP and CP models, it is important to deal with the symmetry of the problem. In the CP model the search is decomposed into two stages; first partially solving the problem by deciding how many rings each node should be on, and then... [12 Jan 2008]
Two-Layer Network Design by Branch-and-Cut Featuring MIP-Based Heuristics
White Paper This paper deals with MIP-based primal heuristics to be used within a branch-and-cut approach for solving multi-layer telecommunication network design problems. Based on a mixed-integer programming formulation for two network layers, the paper... [09 Jan 2008]
