![](https://dblp.uni-trier.de./img/logo.320x120.png)
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
default search action
Annals of Operations Research, Volume 146
Volume 146, Number 1, September 2006
- Walid Ben-Ameur, Daniel Bienstock, Iraj Saniee:
Foreword. 1-2 - Kevin R. Hutson, Douglas R. Shier:
Minimum spanning trees in networks with varying edge weights. 3-18 - Luis Eduardo Neves Gouveia
, Thomas L. Magnanti, Cristina Requejo
:
An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees. 19-39 - Sylvie Borne, Éric Gourdin, Bernard Liau, Ali Ridha Mahjoub:
Design of survivable IP-over-optical networks. 41-73 - Taehan Lee, Sungsoo Park:
Comparison of wavelength requirements between two wavelength assignment methods in survivable WDM networks. 75-89 - Geir Dahl
, Njål Foldnes
:
LP based heuristics for the multiple knapsack problem with assignment restrictions. 91-104 - Jochen Alber, Nadja Betzler, Rolf Niedermeier:
Experiments on data reduction for optimal domination in networks. 105-117 - Igor S. Litvinchev
, Socorro Rangel
:
Using error bounds to compare aggregated generalized transportation models. 119-134 - Edoardo Amaldi, Pietro Belotti
, Antonio Capone
, Federico Malucelli
:
Optimizing base station location and configuration in UMTS networks. 135-151 - Joseph Levy, Hanoch Levy, Yaron Kahana:
Top percentile network pricing and the economics of multi-homing. 153-167 - Wei Feng, Fumio Ohi, Masashi Kowada:
Large deviations of Markovian polling models with applications to admission control. 169-188 - Joris Walraevens
, Bart Steyaert, Herwig Bruneel:
A preemptive repeat priority queue with resampling: Performance analysis. 189-202
![](https://dblp.uni-trier.de./img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.