Sciweavers

2343 search results - page 29 / 469
» The Locomotive Routing Problem
Sort
View
SIAMDM
2008
77views more  SIAMDM 2008»
13 years 7 months ago
The Windy General Routing Polyhedron: A Global View of Many Known Arc Routing Polyhedra
The Windy Postman Problem consists of finding a minimum cost traversal of all the edges of an undirected graph with two costs associated with each edge, representing the costs of ...
Angel Corberán, Isaac Plana, José M....
WEA
2010
Springer
250views Algorithms» more  WEA 2010»
14 years 22 days ago
Randomized Rounding for Routing and Covering Problems: Experiments and Improvements
We investigate how the recently developed different approaches to generate randomized roundings satisfying disjoint cardinality constraints behave when used in two classical algori...
Benjamin Doerr, Marvin Künnemann, Magnus Wahl...
ICMCS
2007
IEEE
136views Multimedia» more  ICMCS 2007»
13 years 11 months ago
Minimum-Multiplicity Routing Problems of Multimedia Communications
In this work, we investigate the routing problems ofminimizing the number ofdistinct transmission mediums or carrier domains for multimedia communications. We consider the problem...
Shengli Yuan
EOR
2007
78views more  EOR 2007»
13 years 7 months ago
A Lagrangean relaxation and decomposition algorithm for the video placement and routing problem
Video on Demand (VoD) is a technology used to provide a number of programs to a number of users on request. In developing a VoD system, a fundamental problem is load balancing, wh...
Tolga Bektas, Osman Oguz, Iradj Ouveysi
CIAC
2003
Springer
142views Algorithms» more  CIAC 2003»
13 years 11 months ago
Differential Approximation for Some Routing Problems
We study vehicle routing problems with constraints on the distance traveled by each vehicle or on the number of vehicles. The objective is to minimize the total distance traveled b...
Cristina Bazgan, Refael Hassin, Jérôm...