research
∙
08/18/2023
Fair Allocation Algorithms for Indivisible Items under Structured Conflict Constraints
We consider the fair allocation of indivisible items to several agents w...
share
research
∙
02/09/2022
Allocation of Indivisible Items with Individual Preference Graphs
This paper studies the allocation of indivisible items to agents, when e...
research
∙
06/30/2021
Optimally rescheduling jobs with a LIFO buffer
This paper considers single-machine scheduling problems in which a given...
research
∙
03/25/2020
Fair packing of independent sets
In this work we add a graph theoretical perspective to a classical probl...
research
∙
01/03/2019
The Product Knapsack Problem: Approximation and Complexity
We consider the product knapsack problem, which is the variant of the cl...
research
∙
03/09/2018
Geometric and LP-based heuristics for the quadratic travelling salesman problem
A generalization of the classical TSP is the so-called quadratic travell...
research
∙
01/15/2018
Approximating the Incremental Knapsack Problem
We consider the 0-1 Incremental Knapsack Problem (IKP) where the capacit...
research
∙
01/11/2018
