Browsing by Author "Santini, Alberto"

Sort by: Order: Results:

  • Monaci, Michele; Pike-Burke, Ciara; Santini, Alberto (Elsevier, 2022)
    We consider a stochastic version of the 0–1 Knapsack Problem in which, in addition to profit and weight, each item is associated with a probability of exploding and destroying all the contents of the knapsack. The objective ...
  • Santini, Alberto; Bartolini, Enrico; Schneider, Michael; Greco de Lemos, Vinicius (Elsevier, 2021)
    In this paper, we study the problem of planning the growth of crops on shelves in vertical farming cabinets under controlled growth conditions. By adjusting temperature, humidity, light, and other environmental conditions ...
  • Santini, Alberto; Archetti, Claudia (Wiley, 2023)
    This article studies the Hazardous Orienteering Problem (HOP), a variant of the more famous Orienteering Problem (OP). In the OP, a vehicle earns a profit for each customer it visits (e.g., to pick up a parcel) subject to ...
  • Santini, Alberto; Malaguti, Enrico (Elsevier, 2023)
    In the min-Knapsack problem, one is given a set of items, each having a certain cost and weight. The objective is to select a subset with minimum cost, such that the sum of the weights is not smaller than a given constant. ...
  • Santini, Alberto; Viana, Ana; Klimentova, Xenia; Pedroso, João Pedro (Elsevier, 2022)
    We study a variant of the Probabilistic Travelling Salesman Problem arising when retailers crowdsource last-mile deliveries to their own customers, who can refuse or accept in exchange for a reward. A planner must identify ...

Search DSpace

Browse

My Account

In collaboration with Compliant to Partaking