✦ LIBER ✦

A branch-and-cut algorithm for capacitated network design problems

✍ Scribed by Oktay Günlük

Publisher: Springer-Verlag
Year: 1999
Tongue: English
Weight: 173 KB
Volume: 86
Category: Article
ISSN: 0025-5610
DOI: 10.1007/s101070050077

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximation Algorithms for a Capacitat

Approximation Algorithms for a Capacitated Network Design Problem

✍ Refael Hassin; R. Ravi; F. Sibel Salman 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 804 KB

A new branch-and-cut algorithm for the c

A new branch-and-cut algorithm for the capacitated vehicle routing problem

✍ Jens Lysgaard; Adam N. Letchford; Richard W. Eglese 📂 Article 📅 2004 🏛 Springer-Verlag 🌐 English ⚖ 203 KB

A branch-and-cut algorithm for solving a

A branch-and-cut algorithm for solving an intraring synchronous optical network design problem

✍ Lee, Youngho; Sherali, Hanif D.; Han, Junghee; Kim, Seong-in 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 133 KB 👁 2 views

In this paper, we deal with a network design problem arising from the deployment of synchronous optical networks (SONET), a standard of transmission using optical fiber technology. The problem is to find an optimal clustering of traffic demands in the network such that the total number of node assig

On cut-based inequalities for capacitate

On cut-based inequalities for capacitated network design polyhedra

✍ Christian Raack; Arie M.C.A. Koster; Sebastian Orlowski; Roland Wessäly 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 375 KB

A Branch-and-Bound Algorithm for Concave

A Branch-and-Bound Algorithm for Concave Network Flow Problems

✍ Dalila B. M. M. Fontes; Eleni Hadjiconstantinou; Nicos Christofides 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 279 KB

A branch and cut algorithm for hub locat

A branch and cut algorithm for hub location problems with single assignment

✍ Martine Labbé; Hande Yaman; Eric Gourdin 📂 Article 📅 2004 🏛 Springer-Verlag 🌐 English ⚖ 282 KB

The hub location problem with single assignment is the problem of locating hubs and assigning the terminal nodes to hubs in order to minimize the cost of hub installation and the cost of routing the traffic in the network. There may also be capacity restrictions on the amount of traffic that can tra