Andrea Pacifici

Information about the author Andrea Pacifici will soon be added to the site.

Found 9 papers in total

Cheapest paths in dynamic networks

2017

Flows over time problems relate to finding optimal flows over a capacitated network...

Strategies in competing subset selection

2013

We address an optimization problem in which two agents, each with a set of weighted...

2012

A set of n nonpreemptive tasks are to be scheduled on m parallel dedicated machines...

2011

We consider a job‐shop scheduling problem with n jobs and the constraint that...

Equilibrium in a two-agent Assignment Problem

2009

In this paper we address a particular generalisation of the Assignment Problem (AP) in...

Multi-agent single machine scheduling

2007

We consider the scheduling problems arising when several agents, each owning a set of...

Scheduling problems with two competing agents

2004

We consider the scheduling problems arising when two agents, each with a set of...

Partitioning of biweighted trees

2002

A districting problem is formulated as a network partitioning model where each link...

2001

We consider the job shop scheduling problem with two jobs. We consider a broad class...

Papers per page: