Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

NETWORKS
2010

favoriteEmaildiscussreport

122views Computer Networks» more NETWORKS 2010»

k-Splittable delay constrained routing problem: A branch-and-price approach

13 years 2 months ago

k-Splittable delay constrained routing problem: A branch-and-price approach

Download www.isima.fr

Jérôme Truffot, Christophe Duhamel, P

Real-time Traffic

Computer Networks | NETWORKS 2010 |

claim paper

Related Content

» A Variable Neighborhood Descent Search Algorithm for DelayConstrained LeastCost Multicast ...

» Connectivity Aware Routing a Method for Finding Bandwidth Constrained Paths Over a Variet...

» Two techniques for fast computation of constrained shortest paths

» Breath An Adaptive Protocol for Industrial Control Applications Using Wireless Sensor Netw...

» Transmission Control Policy design for decentralized detection in sensor networks

» Optimal path selection for ethernet over SONET under inaccurate linkstate information

Post Info
More Details (n/a)

Added	29 Jan 2011
Updated	29 Jan 2011
Type	Journal
Year	2010
Where	NETWORKS
Authors	Jérôme Truffot, Christophe Duhamel, Philippe Mahey

Comments (0)