Zobrazeno 1 - 10
of 201
pro vyhledávání: '"Toriello, Alejandro"'
We study the finite-horizon continuous-time yield management problem with stationary arrival rates and two customer classes. We consider a class of linear threshold policies proposed by Hodge (2008), in which each online (i.e., less desirable) custom
Externí odkaz:
http://arxiv.org/abs/2403.11443
In online sales, sellers usually offer each potential buyer a posted price in a take-it-or-leave fashion. Buyers can sometimes see posted prices faced by other buyers, and changing the price frequently could be considered unfair. The literature on po
Externí odkaz:
http://arxiv.org/abs/2210.05634
The cost due to delay in services may be intrinsically different for various applications of vehicle routing such as medical emergencies, logistical operations, and ride-sharing. We study a fundamental generalization of the Traveling Salesman Problem
Externí odkaz:
http://arxiv.org/abs/2208.04410
Autor:
Toriello, Alejandro
Many supply chain problems involve discrete decisions in a dynamic environment. The inventory routing problem is an example that combines the dynamic control of inventory at various facilities in a supply chain with the discrete routing decisions of
Externí odkaz:
http://hdl.handle.net/1853/42704
Online advertising has motivated interest in online selection problems. Displaying ads to the right users benefits both the platform (e.g., via pay-per-click) and the advertisers (by increasing their reach). In practice, not all users click on displa
Externí odkaz:
http://arxiv.org/abs/2112.00842
Publikováno v:
In Computers and Operations Research August 2024 168
We introduce the $L_p$ Traveling Salesman Problem ($L_p$-TSP), given by an origin, a set of destinations, and underlying distances. The objective is to schedule a destination visit sequence for a traveler of unit speed to minimize the Minkowski $p$-n
Externí odkaz:
http://arxiv.org/abs/2107.10454
Motivated by bursty bandwidth allocation and by the allocation of virtual machines to servers in the cloud, we consider the online problem of packing items with random sizes into unit-capacity bins. Items arrive sequentially, but upon arrival an item
Externí odkaz:
http://arxiv.org/abs/2007.11532
Publikováno v:
In Computers & Industrial Engineering September 2023 183
Publikováno v:
In European Journal of Operational Research 16 April 2023 306(2):615-631