• Publications
  • Influence
On-line single-server dial-a-ride problems
In this paper results on the dial-a-ride problem with a single server are presented. Requests for rides consist of two points in a metric space, a source and a destination. A ride has to be made byExpand
  • 149
  • 17
Algorithms for the on-line travelling salesman
In this paper the problem of efficiently serving a sequence of requests presented in an on-line fashion located at points of a metric space is considered. We call this problem the On-Line TravellingExpand
  • 75
  • 13
Competitive Algorithms for the On-line Traveling Salesman
In this paper the problem of efficiently serving a sequence of requests that are presented in a metric space in an on-line fashion and then returning back to the departure point is considered. TheExpand
  • 68
  • 5
On Capital Investment
We deal with the problem of making capital investments in machines for manufacturing a product. Opportunities for investment occur over time, every such option consists of a capital cost for a newExpand
  • 24
  • 3
Algorithms for the On-Line Travelling Salesman1
Abstract. In this paper the problem of efficiently serving a sequence of requests presented in an on-line fashion located at points of a metric space is considered. We call this problem the On-LineExpand
  • 86
  • 2
Composite Retrieval of Diverse and Complementary Bundles
Users are often faced with the problem of finding complementary items that together achieve a single common goal (e.g., a starter kit for a novice astronomer, a collection of question/answers relatedExpand
  • 39
  • 2
On Capital Investment
Abstract. We deal with the problem of making capital investments in machines for manufacturing a product. Opportunities for investment occur over time, every such option consists of a capital costExpand
  • 22
  • 2
Dynamic algorithms for shortest paths in planar graphs
Abstract We propose data structures for maintaining shortest paths in planar graphs in which the weight of an edge is modified. Our data structures allow us to compute, after an update, theExpand
  • 40
  • 1
Serving Requests with On-line Routing
In this paper we consider the on-line version of the routing problem with release times. Formally, it consists in a metric space M with a distinguished point o (the origin), plus a sequence ofExpand
  • 24
  • 1
New Stochastic Algorithms for Scheduling Ads in Sponsored Search
We introduce a family of algorithms for the selection of ads in sponsored search that intends to increase the variety of choices, while not significantly reducing revenue and maintaining an incentiveExpand
  • 9
  • 1