Sciweavers

15253 search results - page 14 / 3051
» Integer-Programming Software Systems
Sort
View
FSTTCS
2003
Springer
14 years 2 months ago
On the Covering Steiner Problem
The Covering Steiner problem is a common generalization of the k-MST and Group Steiner problems. An instance of the Covering Steiner problem consists of an undirected graph with ed...
Anupam Gupta, Aravind Srinivasan
HPCN
1995
Springer
14 years 1 months ago
Discrete optimisation and real-world problems
In the global economy, proper organisation and planning of production and storage locations, transportation and scheduling are vital to retain the competitive edge of companies. Th...
Josef Kallrath, Anna Schreieck
CONEXT
2005
ACM
13 years 11 months ago
Optimal positioning of active and passive monitoring devices
Network measurement is essential for assessing performance issues, identifying and locating problems. Two common strategies are the passive approach that attaches specific device...
Claude Chaudet, Eric Fleury, Isabelle Guéri...
ENDM
2010
167views more  ENDM 2010»
13 years 7 months ago
Column Generation based Primal Heuristics
In the past decade, significant progress has been achieved in developing generic primal heuristics that made their way into commercial mixed integer programming (MIP) solver. Exte...
C. Joncour, S. Michel, R. Sadykov, D. Sverdlov, Fr...
TCOM
2011
122views more  TCOM 2011»
13 years 4 months ago
Relay Station Placement Strategy in IEEE 802.16j WiMAX Networks
Abstract—In this paper, we study the relay station (RS) placement strategy in IEEE 802.16j WiMAX networks. Specifically, the impact of RS placement on IEEE 802.16j network perfo...
Hsiao-Chen Lu, Wanjiun Liao, Frank Yeong-Sung Lin