The bin packing problem is a well-studied problem in combinatorial optimization. In the
classical bin packing problem, we are given a list of real numbers in (0, 1] and the goal is to …

Big data technology offers unprecedented opportunities to society as a whole and also to its
individual members. At the same time, this technology poses significant risks to those it …

Fairness and robustness are critical elements of Trustworthy AI that need to be addressed
together. Fairness is about learning an unbiased model while robustness is about learning …

Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …

In this article, we address the resource allocation and monetization challenges in Mobile
Edge Computing (MEC) systems, where users have heterogeneous demands and compete …

This paper introduces new environmental constraints, namely carbon emission constraints,
in multi-sourcing lot-sizing problems. These constraints aim at limiting the carbon emission …

We study assortment optimization problems where customer choices are governed by the
nested logit model and there are constraints on the set of products offered in each nest …

When attempting to design a truthful mechanism for a computationally hard problem such as
combinatorial auctions, one is faced with the problem that most efficiently computable …

The theoretical guarantees provided by voting have distinguished it as a prominent method
of preference aggregation among autonomous agents. However, unlike humans, agents …

In this paper, we investigate the symbiosis between a truck and multiple drones in a last-mile
package delivery scenario, introducing the Scheduling Conflictual Deliveries Problem …