We study the online transportation problem. We show that the halfopt-competitive ratio for the greedy algorithm is \Theta(min(m; log C)), where m is the number of server sites, and C is the total number of servers. We also present an algorithm Balance that is a modification of the greedy algorithm and that has a halfopt-competitive ratio of O(1)
We propose a new approach to competitive analysis in online scheduling by introducing the novel conc...
In the online dial-a-ride problem (OLDARP), objects must be transported by a server between points i...
In the online traveling salesman problem requests for visits to cities (points in a metric space) ar...
Online optimization, in contrast to classical optimization, deals with optimization problems whose i...
We consider the open, non-preemptive online Dial-a-Ride problem on the real line, where transportati...
We consider the on-line load balancing problem where there are m identical machines (servers) and a ...
Abstract. We consider the online bottleneck matching problem, where k server-vertices lie in a metri...
The setup for our problem consists of n servers that must complete a set of tasks. Each task can be ...
In the online traveling salesman problem, requests for visits to cities (points in a metric space) a...
In this paper we consider online versions of the Traveling Salesman Problem (TSP) on metric spaces f...
AbstractThe setup for our problem consists of n servers that must complete a set of tasks. Each task...
Combinatorial optimization is the discipline that studies problems in which one seeks to minimize or...
In the online dial-a-ride problem (OlDarp), objects must be transported by a server between points i...
In this paper results on the dial-a-ride problem with a single server are presented. Requests for ri...
We study the online version of the Prize-Collecting Traveling Salesman Problem (PCTSP), a generaliza...
We propose a new approach to competitive analysis in online scheduling by introducing the novel conc...
In the online dial-a-ride problem (OLDARP), objects must be transported by a server between points i...
In the online traveling salesman problem requests for visits to cities (points in a metric space) ar...
Online optimization, in contrast to classical optimization, deals with optimization problems whose i...
We consider the open, non-preemptive online Dial-a-Ride problem on the real line, where transportati...
We consider the on-line load balancing problem where there are m identical machines (servers) and a ...
Abstract. We consider the online bottleneck matching problem, where k server-vertices lie in a metri...
The setup for our problem consists of n servers that must complete a set of tasks. Each task can be ...
In the online traveling salesman problem, requests for visits to cities (points in a metric space) a...
In this paper we consider online versions of the Traveling Salesman Problem (TSP) on metric spaces f...
AbstractThe setup for our problem consists of n servers that must complete a set of tasks. Each task...
Combinatorial optimization is the discipline that studies problems in which one seeks to minimize or...
In the online dial-a-ride problem (OlDarp), objects must be transported by a server between points i...
In this paper results on the dial-a-ride problem with a single server are presented. Requests for ri...
We study the online version of the Prize-Collecting Traveling Salesman Problem (PCTSP), a generaliza...
We propose a new approach to competitive analysis in online scheduling by introducing the novel conc...
In the online dial-a-ride problem (OLDARP), objects must be transported by a server between points i...
In the online traveling salesman problem requests for visits to cities (points in a metric space) ar...
DOI
Add to ORKG