Sciweavers

3016 search results - page 88 / 604
» The Online Transportation Problem
Sort
View
SIGSAND
2008
13 years 11 months ago
Relational Model Driven Application Design
Abstract: A closer look at typical information systems shows that relatively simple routines often contribute significantly to the overall expenses of the software development proc...
Michael Guckert, René Gerlach
APPROX
2010
Springer
154views Algorithms» more  APPROX 2010»
13 years 11 months ago
The Checkpoint Problem
In this paper, we consider the checkpoint problem in which given an undirected graph G, a set of sourcedestinations {(s1, t1), (s1, t1), . . . , (sk, tk)} and a set of fixed paths...
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kor...
STOC
2009
ACM
139views Algorithms» more  STOC 2009»
14 years 10 months ago
Online and stochastic survivable network design
Consider the edge-connectivity survivable network design problem: given a graph G = (V, E) with edge-costs, and edgeconnectivity requirements rij Z0 for every pair of vertices i,...
Anupam Gupta, Ravishankar Krishnaswamy, R. Ravi
ANOR
2004
208views more  ANOR 2004»
13 years 10 months ago
Airline Crew Rostering: Problem Types, Modeling, and Optimization
Airline crew rostering is an important part of airline operations and an interesting problem for the application of operations research. The objective is to assign anonymous crew p...
Niklas Kohl, Stefan E. Karisch
COR
2004
139views more  COR 2004»
13 years 10 months ago
A tabu search heuristic for the vehicle routing problem with time windows and split deliveries
The routing of a fleet of vehicles to service a set of customers is important in the field of distribution. Vehicle Routing Problems (VRP) arise in many real-life applications wit...
Sin C. Ho, Dag Haugland