Gaia Nicosia

Theor. Comput. Sci., 2015

Scheduling two agent task chains with a central selection mechanism.

[BibT_eX]

[DOI]

J. Sched., 2015

Brief Announcement: On the Fair Subset Sum Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory - 8th International Symposium, 2015

Price of Fairness for Multiagent Subset Sum Problems.

[BibT_eX]

Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

2014

The Subset Sum game.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2014

Preface.

[BibT_eX]

[DOI]

Ulrich Faigle

Discret. Appl. Math., 2014

Cyclic Schedules for Pipeline Assembly Processes.

[BibT_eX]

[DOI]

Marta Flamini

Proceedings of the UKSim-AMSS 16th International Conference on Computer Modelling and Simulation, 2014

2013

Strategies in competing subset selection.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2013

Minimizing Part Transfer Costs in Flexible Manufacturing Systems: A Computational Study on Different Lower Bounds.

[BibT_eX]

[DOI]

Giuseppina Falcone

Proceedings of the 15th International Conference on Computer Modelling and Simulation, 2013

Scheduling Tasks with Comb Precedence Constraints on Dedicated Machines.

[BibT_eX]

[DOI]

Proceedings of the 7th IFAC Conference on Manufacturing Modelling, Management, and Control, 2013

Two Agents Competing for a Shared Machine.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Decision Theory - Third International Conference, 2013

2012

Parallel dedicated machines scheduling with chain precedence constraints.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2012

Strategies for Single-machine Multi-agent Scheduling Problems.

[BibT_eX]

Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012

Scheduling Two Chains on Parallel Dedicated Machines.

[BibT_eX]

Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012

2011

A job-shop problem with one additional resource type.

[BibT_eX]

[DOI]

J. Sched., 2011

Optimal power control in OFDMA cellular networks.

[BibT_eX]

[DOI]

Networks, 2011

Competitive subset selection with two agents.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2011

2010

On the bicriteria <i>k</i>-server problem.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2010

Stable routing under the Spanning Tree Protocol.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2010

Scheduling three chains on two parallel machines.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2010

2009

Single-Machine Scheduling Problems with Generalized Preemption.

[BibT_eX]

[DOI]

Alessandro Agnetis

INFORMS J. Comput., 2009

On Multi-Agent Knapsack Problems.

[BibT_eX]

[DOI]

Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

Subset Weight Maximization with Two Competing Agents.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Decision Theory, First International Conference, 2009

2008

Optimum Channel Allocation in OFDMA Multi-cell Systems.

[BibT_eX]

[DOI]

Proceedings of the Network Control and Optimization, Second Euro-NF Workshop, 2008

Local Restoration for Trees and Arborescences.

[BibT_eX]

[DOI]

Proceedings of the Traffic Management and Traffic Engineering for the Future Internet, 2008

Cellular radio resource allocation problem.

[BibT_eX]

Proceedings of the Seventh Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2008

2007

On-line load balancing made simple: Greedy strikes back.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2007

Minimum cost multi-product flow lines.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2007

2006

Efficient offline algorithms for the bicriteria <i>k</i>-server problem and online applications.

[BibT_eX]

[DOI]

Alfredo Navarra

J. Discrete Algorithms, 2006

Exact algorithms for a discrete metric labeling problem.

[BibT_eX]

[DOI]

Discret. Optim., 2006

Competitive algorithms for the bicriteria k-server problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2006

2004

Exact algorithms for a discrete metric labeling problem.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2004

A heuristic approach to batching and scheduling a single machine to minimize setup costs.

[BibT_eX]

[DOI]

Alessandro Agnetis

Comput. Ind. Eng., 2004

A Decentralized Route Guidance Algorithm in Urban Transportation Networks.

[BibT_eX]

Ludovica Adacher

Proceedings of the ICINCO 2004, 2004

2003

An approximate A* algorithm and its application to the SCS problem.

[BibT_eX]

[DOI]

Gianpaolo Oriolo

Theor. Comput. Sci., 2003

Part Batching and Scheduling in a Flexible Cell to Minimize Setup Costs.

[BibT_eX]

[DOI]

Alessandro Agnetis

J. Sched., 2003

Online Load Balancing Made Simple: Greedy Strikes Back.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

2002

Optimally balancing assembly lines with different workstations.

[BibT_eX]

[DOI]

Dario Pacciarelli

Discret. Appl. Math., 2002

2000

On-line scheduling with setup costs.

[BibT_eX]

[DOI]

Giorgio Gambosi

Inf. Process. Lett., 2000

On Multicriteria Online Problems.

[BibT_eX]

[DOI]