๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Models and algorithms for network design problems

โœ Scribed by Poss, Michael

Book ID
113058712
Publisher
Springer
Year
2011
Tongue
English
Weight
84 KB
Volume
10
Category
Article
ISSN
1619-4500

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A general MPCC model and its solution al
A general MPCC model and its solution algorithm for continuous network design problem
โœ Jeff X. Ban; Henry X. Liu; Michael C. Ferris; Bin Ran ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 459 KB

This paper formulates the continuous network design problem as a mathematical program with complementarity constraints (MPCC), with the upper level a nonlinear programming problem and the lower level a nonlinear complementarity problem. Unlike in most previous studies, the proposed framework is more

Approximation Algorithms for Network Des
Approximation Algorithms for Network Design Problems on Bounded Subsets
โœ Dorit S. Hochbaum; Joseph (Seffi) Naor ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 141 KB

We address the problem of designing a network so that certain connectivity requirements are satisfied, at minimum cost of the edges used. The requirements are specified for each subset of vertices in terms of the number of edges with one endpoint in the set. We address a class of such problems, wher