Catálogo de publicaciones - libros

Compartir en
redes sociales


Combinatorial Optimization in Communication Networks

Maggie Xiaoyan Cheng ; Yingshu Li ; Ding-Zhu Du (eds.)

Resumen/Descripción – provisto por la editorial

No disponible.

Palabras clave – provistas por la editorial

No disponibles.

Disponibilidad
Institución detectada Año de publicación Navegá Descargá Solicitá
No detectada 2006 SpringerLink

Información

Tipo de recurso:

libros

ISBN impreso

978-0-387-29025-6

ISBN electrónico

978-0-387-29026-3

Editor responsable

Springer Nature

País de edición

Reino Unido

Fecha de publicación

Información sobre derechos de publicación

© Springer Science+Business Media, Inc. 2006

Tabla de contenidos

Optimization of Failure Recovery in High-Speed Networks

Terence T. Y. Kam; Dongsoo S. Kim

In this chapter, we have presented a different approach to solve the problems of RWA in wavelength-routed survivable optical networks. This approach solves the problems of RWA jointly by formulating the problem as a linear programming problem. Although this approach increases the number of variables required to formulate the problem, it ensures obtaining the optimum solution. The study also found that many network optimization problems can be solved using an LP solvers. However, more research is needed to investigate the problem and find out ways to ensure integer solutions using LP solver when an optimum integer solution is feasible. The following problem formulation has been performed:

Part III - Combinatorial Optimization in | Pp. 595-622

An Approximation Algorithm for the Dynamic Facility Location Problem

Yinyu Ye; Jiawei Zhang

Ad hoc networks are an area of telecommunications that has grown in popularity due to its wide applicability. It also presents some interesting and difficult optimization problems. In this chapter we presented some of the optimization issues related to ad hoc networks, as well as techniques employed in their solution. This is an active area of research, and certainly will see many developments in the near future in terms of improved formulations and algorithms.

Part III - Combinatorial Optimization in | Pp. 623-637

Genetic Code-Based DNA Computation for the Hamiltonian Path Problem

Mingjun Zhang; Maggie X. Cheng; Tzyh-Jong Tarn

In this chapter, the time-independent Green’s functions are defined, their main properties are presented, methods for their calculation are briefly discussed, and their use in problems of physical interest is summarized.

Part III - Combinatorial Optimization in | Pp. 639-658