A Branch and Bound Algorithm for Primary Routes Assignment in Survivable Connection Oriented Networks

ISSN： 0926-6003

Source： Computational Optimization and Applications, Vol.27, Iss.2, 2004-02, pp. : 149-171

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Connection provisioning with guaranteed recovery time in survivable WDM optical networks

By Ouyang Yong Zeng Qingji

Photonic Network Communications, Vol. 12, Iss. 3, 2006-12 ,pp. : 309-319

Springer Publishing Company

Access to resources Recommend Favorite

Branch and bound algorithms for the multidimensional assignment problem

By Pasiliao Eduardo Pardalos Panos Pitsoulis Leonidas

Optimization Methods and Software, Vol. 20, Iss. 1, 2005-02 ,pp. : 127-143

Taylor & Francis Ltd

Access to resources Recommend Favorite

A branch and bound algorithm for the robust shortest path problem with interval data

By Montemanni R. Gambardella L.M. Donati A.V.

Operations Research Letters, Vol. 32, Iss. 3, 2004-05 ,pp. : 225-232

Elsevier

Access to resources Recommend Favorite

A best-first branch and bound algorithm for unconstrained two-dimensional cutting problems

By G Y-G. Seong Y.-J. Kang M.-K.

Operations Research Letters, Vol. 31, Iss. 4, 2003-07 ,pp. : 301-307

Elsevier

Access to resources Recommend Favorite

Finiteness Result for the Simplicial Branch-and-Bound Algorithm Based on ω-Subdivisions

By Locatelli M. Raber U.

Journal of Optimization Theory and Applications, Vol. 107, Iss. 1, 2000-10 ,pp. : 81-88

Springer Publishing Company

Access to resources Recommend Favorite