✦ LIBER ✦

Algorithms for a network design problem with crossing supermodular demands

✍ Scribed by Vardges Melkonian; Éva Tardos

Publisher: John Wiley and Sons
Year: 2004
Tongue: English
Weight: 186 KB
Volume: 43
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.20005

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Lagrangean-based decomposition algorithm

Lagrangean-based decomposition algorithms for multicommodity network design problems with penalized constraints

✍ Tolga Bektaş; Mervat Chouman; Teodor Gabriel Crainic 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 141 KB

## Abstract This article discusses problems in the context of multicommodity network design where additional constraints (such as capacity), rather than being imposed in a strict manner, are allowed to be violated at the expense of additional penalty costs. Such penalized cost structures allow thes

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

A neural network combined two-stage algo

A neural network combined two-stage algorithm for route assignment problems with reliability satisfaction in multihop radio networks

✍ Takayuki Baba; Nobuo Funabiki; Shigeto Tajima 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 302 KB

A self-adaptive genetic algorithm-artifi

A self-adaptive genetic algorithm-artificial neural network algorithm with leave-one-out cross validation for descriptor selection in QSAR study

✍ Jingheng Wu; Juan Mei; Sixiang Wen; Siyan Liao; Jincan Chen; Yong Shen 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 452 KB

## Abstract Based on the quantitative structure‐activity relationships (QSARs) models developed by artificial neural networks (ANNs), genetic algorithm (GA) was used in the variable‐selection approach with molecule descriptors and helped to improve the back‐propagation training algorithm as well. T

A local branching heuristic for mixed-in

A local branching heuristic for mixed-integer programs with 2-level variables, with an application to a telecommunication network design problem

✍ Matteo Fischetti; Carlo Polo; Massimo Scantamburlo 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 260 KB