Sciweavers

2343 search results - page 267 / 469
» The Locomotive Routing Problem
Sort
View
CONEXT
2008
ACM
15 years 8 months ago
High-throughput, reliable multicast without "crying babies" in wireless mesh networks
There are two primary challenges to supportinghigh-throughput, reliable multicast in wireless mesh networks (WMNs). The first is no different from unicast: wireless links are inhe...
Dimitrios Koutsonikolas, Y. Charlie Hu, Chih-Chun ...
JACM
2007
121views more  JACM 2007»
15 years 6 months ago
(Almost) Tight bounds and existence theorems for single-commodity confluent flows
A flow of a commodity is said to be confluent if at any node all the flow of the commodity leaves along a single edge. In this paper we study single-commodity confluent flow pro...
Jiangzhuo Chen, Robert D. Kleinberg, Lászl&...
CORR
2011
Springer
210views Education» more  CORR 2011»
15 years 1 months ago
Competitive and Deterministic Embeddings of Virtual Networks
Network virtualization is a paradigm that allows for flexible and efficient allocation of the resources among multiple virtual networks (VNets). In this paper we deal with the p...
Guy Even, Moti Medina, Gregor Schaffrath, Stefan S...
AAAI
2000
15 years 7 months ago
Human-Guided Simple Search
Scheduling, routing, and layout tasks are examples of hard operations-research problems that have broad application in industry. Typical algorithms for these problems combine some...
David Anderson, Emily Anderson, Neal Lesh, Joe Mar...
AOR
2010
15 years 4 months ago
Solutions diversification in a column generation algorithm
Column generation algorithms have been specially designed for solving mathematical programs with a huge number of variables. Unfortunately, this method suffers from slow convergen...
Nora Touati Moungla, Lucas Létocart, Anass ...