Journal ArticleDOI
Telecommunication Node Clustering with Node Compatibility and Network Survivability Requirements
Reads0
Chats0
TLDR
This work considers the node clustering problem that arises in designing a survivable two-level telecommunication network and proposes an integer programming formulation of the problem by decomposing the entire problem into a master problem and a number of column generation problems.Abstract:
We consider the node clustering problem that arises in designing a survivable two-level telecommunication network. The problem simultaneously determines an optimal partitioning of the whole network into clusters (local networks) and hub locations in each cluster. Intercluster traffic minimization is chosen as the clustering criterion to improve the service quality. Various constraints on the clustering are considered which reflect both the physical structures of local networks, such as the connectivity requirement, and the node compatibility relations such as community of interest or policy. Additional constraints may be imposed on the hub selection to ensure network survivability. We propose an integer programming formulation of the problem by decomposing the entire problem into a master problem and a number of column generation problems. The master problem is solved by column generation and the column generation problems by branch-and-cut. We develop and use strong cutting-planes for the cluster generation subproblems. Computational results using real data are reported.read more
Citations
More filters
Journal ArticleDOI
50th Anniversary Article: The Evolution of Research on Information Systems: A Fiftieth-Year Survey of the Literature in Management Science
TL;DR: Based on a discussion of these streams, the IS literature's core contributions to theoretical and managerial knowledge are evaluated, and some predictions about the road that lies ahead for IS researchers are made.
DissertationDOI
Rapid Mathematical Programming
TL;DR: It is shown that today's MIP solvers are capable of solving the resulting mixed integer programs, leading to an approach that delivers results very quickly, and the modeling language Zimpl is introduced.
Journal ArticleDOI
Multiple criteria districting problems
TL;DR: A new method to approximate the Pareto front based on an evolutionary algorithm with local search is proposed, which allows to solve large-size instances in a reasonable CPU time and generates high quality solutions.
Journal ArticleDOI
A multi-criteria Police Districting Problem for the efficient and effective design of patrol sector
TL;DR: This is the first model for the PDP that considers the attributes of area, risk, compactness, and mutual support and it produces designs that significantly improve on the current ones.
Journal ArticleDOI
Graph partitioning using linear and semidefinite programming
Abdel Lisser,Franz Rendl +1 more
TL;DR: Both linear and semidefinite relaxations for the equipartition problem are considered and numerical results on real data from France Telecom networks with up 900 nodes, and also on randomly generated problems are presented.
References
More filters
Journal ArticleDOI
A Linear Programming Approach to the Cutting-Stock Problem
P. C. Gilmore,Ralph E. Gomory +1 more
TL;DR: In this paper, a technique is described for overcoming the difficulty in the linear programming formulation of the cutting-stock problem, which enables one to compute always with a matrix which has no more columns than it has rows.
Journal ArticleDOI
A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems
Manfred Padberg,Giovanni Rinaldi +1 more
TL;DR: An algorithm is described for solving large-scale instances of the Symmetric Traveling Salesman Problem (STSP) to optimality using a “polyhedral” cutting-plane procedure that exploits a subset of the system of linear inequalities defining the convex hull of the incidence vectors of the hamiltonian cycles of a complete graph.
Book
Fiber Network Service Survivability
TL;DR: This book examines the architectures, technologies, and design methods that make it possible to achieve a survivable fiber network, both practically and economically, and explores alternative methods and presents analytical and computational optimization approaches.
Journal ArticleDOI
The boolean quadric polytope: Some characteristics, facets and relatives
TL;DR: It is shown that the known polynomiality result for the maximization of nonnegative quadratic forms can be obtained by simply rounding the solution to the linear programming relaxation, and the Boolean quadric polytope QPn inn(n+1)/2 dimensions is considered.
Journal ArticleDOI
Min-cut clustering
TL;DR: A decomposition framework and a column generation scheme for solving a min-cut clustering problem that is itself an NP-hard mixed integer programming problem and some efficient solution strategies are described.