Sciweavers

4674 search results - page 334 / 935
» cases 2008
Sort
View
MANSCI
2008
102views more  MANSCI 2008»
15 years 6 months ago
Revenue Management of Callable Products
We introduce callable products into a finite-capacity, two-period sales or booking process where low-fare customers book first. A callable product is a unit of capacity sold at th...
Guillermo Gallego, S. G. Kou, Robert Phillips
MONET
2008
90views more  MONET 2008»
15 years 6 months ago
Cognitive Radio Design on an MPSoC Reconfigurable Platform
Cognitive Radio has been proposed as a promising technology to solve today's spectrum scarcity problem by dynamic spectrum access. The MPSoC reconfigurable platform is propose...
Qiwei Zhang, André B. J. Kokkeler, Gerard J...
NETWORKS
2008
15 years 6 months ago
Lower bounds for two-period grooming via linear programming duality
In a problem arising in grooming for two-period optical networks, it is required to decompose the complete graph on n vertices into subgraphs each containing at most C edges, so t...
Charles J. Colbourn, Gaetano Quattrocchi, Violet R...
ORL
2008
99views more  ORL 2008»
15 years 6 months ago
Some tractable instances of interval data minmax regret problems
This paper focuses on tractable instances of interval data minmax regret graph problems. More precisely, we provide polynomial and pseudopolynomial algorithms for sets of particul...
Bruno Escoffier, Jérôme Monnot, Olivi...
ORL
2008
77views more  ORL 2008»
15 years 6 months ago
A short proof of the VPN Tree Routing Conjecture on ring networks
The VPN Tree Routing Conjecture states that there always exists an optimal solution to the symmetric Virtual Private Network Design (sVPND) problem where the paths between all ter...
Fabrizio Grandoni, Volker Kaibel, Gianpaolo Oriolo...