Sciweavers

2862 search results - page 24 / 573
» Bicriteria Network Design Problems
Sort
View
DISOPT
2008
107views more  DISOPT 2008»
13 years 9 months ago
The k-path tree matroid and its applications to survivable network design
We define the k-path tree matroid, and use it to solve network design problems in which the required connectivity is arbitrary for a given pair of nodes, and 1 for the other pairs...
Esther M. Arkin, Refael Hassin
GECCO
2004
Springer
234views Optimization» more  GECCO 2004»
14 years 3 months ago
A Generic Network Design for a Closed-Loop Supply Chain Using Genetic Algorithm
Recently much research has focused on both the supply chain and reverse logistics network design problem. The rapid progress in computer and network technology and the increasingly...
Eoksu Sim, Sungwon Jung, Haejoong Kim, Jinwoo Park
WG
2000
Springer
14 years 1 months ago
Budget Constrained Minimum Cost Connected Medians
Several practical instances of network design and location theory problems require the network to satisfy multiple constraints. In this paper, we address graph-theoretic problems t...
Goran Konjevod, Sven Oliver Krumke, Madhav V. Mara...
INFOCOM
2010
IEEE
13 years 8 months ago
Handling Triple Hidden Terminal Problems for Multi-Channel MAC in Long-Delay Underwater Sensor Networks
In this paper, we investigate the multi-channel MAC problem in underwater acoustic sensor networks. To reduce hardware cost, only one acoustic transceiver is often preferred on ev...
Zhong Zhou, Zheng Peng, Jun-Hong Cui, Zaihan Jiang
COCOA
2008
Springer
13 years 11 months ago
Strong Formulations for 2-Node-Connected Steiner Network Problems
Abstract. We consider a survivable network design problem known as the 2-NodeConnected Steiner Network Problem (2NCON): we are given a weighted undirected graph with a node partiti...
Markus Chimani, Maria Kandyba, Ivana Ljubic, Petra...