The following pages link to Paolo Dell'Olmo (Q190513):
Displaying 50 items.
- An approximation result for a duo-processor task scheduling problem (Q286992) (← links)
- Scheduling chains to minimize mean flow time (Q290213) (← links)
- A 13/12 approximation algorithm for bin packing with extendable bins (Q293250) (← links)
- (Q590537) (redirect page) (← links)
- Planning activities in a network of logistic platforms with shared resources (Q596457) (← links)
- Evaluating the effects of the clique selection in exact graph colouring algorithms (Q659453) (← links)
- On finding dissimilar Pareto-optimal paths (Q707132) (← links)
- (Q858261) (redirect page) (← links)
- Delivery itineraries and distribution capacity of a freight network with time slots (Q858262) (← links)
- Scheduling models for air traffic control in terminal areas (Q880545) (← links)
- Graph models for scheduling systems with machine saturation property (Q883067) (← links)
- Scheduling multiprocessor tasks on three dedicated processors (Q1197982) (← links)
- Preemptive scheduling of multiprocessor tasks on the dedicated processor system subject to minimal lateness (Q1261479) (← links)
- Minimizing total completion time subject to release dates and sequence-dependent processing times (Q1290157) (← links)
- Approximation algorithms for partitioning small items in unequal bins to minimize the total size (Q1293199) (← links)
- Corrigendum to: ``Scheduling multiprocessor tasks on three dedicated processors'' (Q1318754) (← links)
- Efficiency and effectiveness of normal schedules on three dedicated processors (Q1356693) (← links)
- An optimal algorithm to find the jump number of partially ordered sets (Q1366304) (← links)
- Preemptive multiprocessor task scheduling with release times and time windows (Q1374419) (← links)
- Scheduling multiprocessor tasks on parallel processors with limited availability. (Q1399581) (← links)
- Assessing the resource usage in scheduling with incompatibilities (Q1412167) (← links)
- Complexity and approximation results for scheduling multiprocessor tasks on a ring. (Q1417558) (← links)
- An approximation result for the interval coloring problem on claw-free chordal graphs (Q1613366) (← links)
- Mathematical models for on-line train calendars generation (Q1628108) (← links)
- (Q1772869) (redirect page) (← links)
- Experimental evaluation of approximation and heuristic algorithms for the dominating paths problem (Q1772870) (← links)
- A new hierarchical architecture for air traffic management: optimisation of airway capacity in a free flight scenario (Q1869699) (← links)
- Scheduling multiprocessor tasks on a dynamic configuration of dedicated processors (Q1904737) (← links)
- Scheduling multiprocessor tasks for mean flow time criterion (Q1977621) (← links)
- Sparse analytic hierarchy process: an experimental analysis (Q2317618) (← links)
- CHECKCOL: improved local search for graph coloring (Q2458929) (← links)
- Exploiting incomplete information to manage multiprocessor tasks with variable arrival rates (Q2459394) (← links)
- Coloring graphs by iterated local search traversing feasible and infeasible solutions (Q2467355) (← links)
- Embedding a novel objective function in a two-phased local search for robust vertex coloring (Q2482807) (← links)
- On uniform \(k\)-partition problems (Q2565854) (← links)
- (Q2708486) (← links)
- (Q2712299) (← links)
- Solving the minimum-weighted coloring problem (Q2748384) (← links)
- Novel Local-Search-Based Approaches to University Examination Timetabling (Q2900997) (← links)
- (Q3070858) (← links)
- The Spatially Equitable Multicommodity Capacitated Network Flow Problem (Q3091503) (← links)
- Scheduling multiprocessor tasks on two parallel processors (Q3148375) (← links)
- Bounding vertex coloring by truncatedmultistage branch and bound (Q3157032) (← links)
- Coupling Stochastic and Deterministic Local Search in Examination Timetabling (Q3392080) (← links)
- Lower bound algorithms for multiprocessor task scheduling with ready times (Q3410325) (← links)
- Heuristic approaches for the Minimum Labelling Hamiltonian Cycle Problem (Q3439489) (← links)
- (Q4233360) (← links)
- (Q4233384) (← links)
- (Q4250862) (← links)
- Scheduling preemptive multiprocessor tasks on dedicated processors (Q4309189) (← links)
