Paolo Dell'Olmo

From MaRDI portal
Revision as of 21:03, 8 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Paolo Dell'Olmo to Paolo Dell'Olmo: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:190513

Available identifiers

zbMath Open dellolmo.paoloMaRDI QIDQ190513

List of research outcomes





PublicationDate of PublicationType
Multi-objective mathematical programming for optimally sizing and managing battery energy storage for solar photovoltaic system integration of a multi-apartment building2023-10-10Paper
Flow Shop No-Wait Scheduling With Sequence Dependent Setup Times And Release Dates2023-04-21Paper
Sparse analytic hierarchy process: an experimental analysis2019-08-12Paper
Mathematical models for on-line train calendars generation2018-12-03Paper
A 13/12 approximation algorithm for bin packing with extendable bins2016-06-09Paper
Scheduling chains to minimize mean flow time2016-06-01Paper
An approximation result for a duo-processor task scheduling problem2016-05-26Paper
Novel Local-Search-Based Approaches to University Examination Timetabling2012-07-28Paper
Evaluating the effects of the clique selection in exact graph colouring algorithms2012-01-18Paper
The Spatially Equitable Multicommodity Capacitated Network Flow Problem2011-09-09Paper
https://portal.mardi4nfdi.de/entity/Q30708582011-01-28Paper
Coupling Stochastic and Deterministic Local Search in Examination Timetabling2009-08-13Paper
Embedding a novel objective function in a two-phased local search for robust vertex coloring2008-04-24Paper
Coloring graphs by iterated local search traversing feasible and infeasible solutions2008-01-21Paper
Exploiting incomplete information to manage multiprocessor tasks with variable arrival rates2007-11-06Paper
CHECKCOL: improved local search for graph coloring2007-11-05Paper
Graph models for scheduling systems with machine saturation property2007-05-31Paper
Heuristic approaches for the Minimum Labelling Hamiltonian Cycle Problem2007-05-29Paper
Scheduling models for air traffic control in terminal areas2007-05-15Paper
Delivery itineraries and distribution capacity of a freight network with time slots2007-01-09Paper
Lower bound algorithms for multiprocessor task scheduling with ready times2006-11-27Paper
On uniform \(k\)-partition problems2005-09-28Paper
Experimental evaluation of approximation and heuristic algorithms for the dominating paths problem2005-04-21Paper
On finding dissimilar Pareto-optimal paths2005-02-09Paper
Bounding vertex coloring by truncatedmultistage branch and bound2005-01-12Paper
Planning activities in a network of logistic platforms with shared resources2004-08-10Paper
A dynamic programming approach for the airport capacity allocation problem2004-05-27Paper
https://portal.mardi4nfdi.de/entity/Q44530142004-03-07Paper
https://portal.mardi4nfdi.de/entity/Q44944102004-02-18Paper
Complexity and approximation results for scheduling multiprocessor tasks on a ring.2004-01-05Paper
Assessing the resource usage in scheduling with incompatibilities2003-11-09Paper
Scheduling multiprocessor tasks on parallel processors with limited availability.2003-07-30Paper
A new hierarchical architecture for air traffic management: optimisation of airway capacity in a free flight scenario2003-04-28Paper
https://portal.mardi4nfdi.de/entity/Q49449952003-01-20Paper
Scheduling multiprocessor tasks on two parallel processors2002-09-30Paper
An approximation result for the interval coloring problem on claw-free chordal graphs2002-08-29Paper
Iterative coloring extension of a maximum clique2002-08-12Paper
An approximation result for a periodic allocation problem2002-07-30Paper
Constraint propagation in graph coloring2002-04-11Paper
A lower bound on the chromatic number of Mycielski graphs2001-11-28Paper
Solving the minimum-weighted coloring problem2001-10-14Paper
https://portal.mardi4nfdi.de/entity/Q27122992001-05-06Paper
https://portal.mardi4nfdi.de/entity/Q27084862001-04-17Paper
Scheduling multiprocessor tasks for mean flow time criterion2001-03-04Paper
https://portal.mardi4nfdi.de/entity/Q42508622001-01-30Paper
https://portal.mardi4nfdi.de/entity/Q49435562000-03-16Paper
Approximation algorithms for partitioning small items in unequal bins to minimize the total size1999-06-28Paper
Minimizing total completion time subject to release dates and sequence-dependent processing times1999-06-10Paper
https://portal.mardi4nfdi.de/entity/Q42333601999-03-16Paper
https://portal.mardi4nfdi.de/entity/Q42333841999-03-16Paper
An optimal algorithm to find the jump number of partially ordered sets1998-05-25Paper
https://portal.mardi4nfdi.de/entity/Q43872651998-05-07Paper
Preemptive multiprocessor task scheduling with release times and time windows1998-01-28Paper
https://portal.mardi4nfdi.de/entity/Q43568811997-12-18Paper
Efficiency and effectiveness of normal schedules on three dedicated processors1997-06-10Paper
Linear algorithms for preemptive scheduling of multiprocessor tasks subject to minimal lateness1997-05-22Paper
https://portal.mardi4nfdi.de/entity/Q56906381997-01-07Paper
Scheduling multiprocessor tasks on a dynamic configuration of dedicated processors1996-05-02Paper
https://portal.mardi4nfdi.de/entity/Q48434461996-04-29Paper
https://portal.mardi4nfdi.de/entity/Q48363041995-06-14Paper
https://portal.mardi4nfdi.de/entity/Q43130621994-11-10Paper
Scheduling preemptive multiprocessor tasks on dedicated processors1994-11-01Paper
Corrigendum to: ``Scheduling multiprocessor tasks on three dedicated processors1994-04-05Paper
Preemptive scheduling of multiprocessor tasks on the dedicated processor system subject to minimal lateness1994-02-17Paper
Scheduling multiprocessor tasks on three dedicated processors1993-01-16Paper

Research outcomes over time

This page was built for person: Paolo Dell'Olmo