Sciweavers

148 search results - page 28 / 30
» arcs 2006
Sort
View
COR
2008
160views more  COR 2008»
13 years 4 months ago
Formulations and exact algorithms for the vehicle routing problem with time windows
In this paper we review the exact algorithms proposed in the last three decades for the solution of the vehicle routing problem with time windows (VRPTW). The exact algorithms for...
Brian Kallehauge
ORDER
2006
97views more  ORDER 2006»
13 years 5 months ago
Upward Three-Dimensional Grid Drawings of Graphs
A three-dimensional grid drawing of a graph is a placement of the vertices at distinct points with integer coordinates, such that the straight line segments representing the edges ...
Vida Dujmovic, David R. Wood
IJRR
2002
129views more  IJRR 2002»
13 years 5 months ago
Deformable Free-Space Tilings for Kinetic Collision Detection
We present kinetic data structures for detecting collisions between a set of polygons that are moving continuously. Unlike classical collision detection methods that rely on bound...
Pankaj K. Agarwal, Julien Basch, Leonidas J. Guiba...
GEOINFORMATICA
1998
107views more  GEOINFORMATICA 1998»
13 years 5 months ago
A Comparison of Two Approaches to Ranking Algorithms Used to Compute Hill Slopes
The calculation of slope (downhill gradient) for a point in a digital elevation model (DEM) is a common procedure in the hydrological, environmental and remote sensing sciences. T...
Kevin H. Jones
MP
1998
136views more  MP 1998»
13 years 5 months ago
Minimum cost capacity installation for multicommodity network flows
Consider a directed graph G = (V;A), and a set of tra c demands to be shipped between pairs of nodes in V. Capacity has to be installed on the edges of this graph (in integer mult...
Daniel Bienstock, Sunil Chopra, Oktay Günl&uu...