The following pages link to Massimiliano Caramia (Q190512):
Displaying 50 items.
- Resource levelling in project scheduling with generalized precedence relationships and variable execution intensities (Q280170) (← links)
- (Q360496) (redirect page) (← links)
- On a facility location problem with applications to tele-diagnostic (Q360498) (← links)
- An exact algorithm to minimize the makespan in project scheduling with scarce resources and generalized precedence relations (Q439614) (← links)
- Enhanced exact algorithms for discrete bilevel linear problems (Q499703) (← links)
- Evaluating the effects of the clique selection in exact graph colouring algorithms (Q659453) (← links)
- A new lower bound for the resource-constrained project scheduling problem with generalized precedence relations (Q709101) (← links)
- Minimizing the completion time of a project under resource constraints and feeding precedence relations: a Lagrangian relaxation based lower bound (Q766253) (← links)
- A new approach for scheduling independent tasks with multiple modes (Q835753) (← links)
- A fast heuristic algorithm for the maximum concurrent \(k\)-splittable flow problem (Q845550) (← links)
- Delivery itineraries and distribution capacity of a freight network with time slots (Q858262) (← links)
- Evaluating the effects of parking price and location in multi-modal transportation networks (Q875631) (← links)
- An exact approach for the maximum concurrent \(k\)-splittable flow problem (Q928300) (← links)
- On the effectiveness of the harmonic shelf algorithm for on-line strip packing (Q932692) (← links)
- On the approximation of the single source \(k\)-splittable flow problem (Q935843) (← links)
- Experimenting crossover operators to solve the vehicle routing problem with time windows by genetic algorithms (Q948847) (← links)
- On the maximum \(q\)-colourable induced subgraph problem in perfect graphs (Q964478) (← links)
- An asymptotic worst case analysis of the effectiveness of the harmonic 3D-shelf algorithm for online 3D-strip packing (Q975802) (← links)
- A superclass of edge-path-tree graphs with few cliques (Q1038105) (← links)
- On the selection of \(k\) efficient paths by clustering techniques (Q1046590) (← links)
- Assessing the resource usage in scheduling with incompatibilities (Q1412167) (← links)
- On the choice of the penalty parameter for discrete-continuous linear bi-level problems reformulation (Q1635436) (← links)
- Fluidsim: a car traffic simulation prototype based on fluiddynamic (Q1662556) (← links)
- Mengerian quasi-graphical families and clutters (Q1933646) (← links)
- Minimizing the completion time of a project under resource constraints and feeding precedence relations: an exact algorithm (Q1935550) (← links)
- Maximizing recyclable materials and user utility in waste collection: a linear-quadratic bilevel optimization approach (Q2047184) (← links)
- Project scheduling with generalized precedence relations: a new method to analyze criticalities and flexibilities (Q2076817) (← links)
- An application of bilevel optimisation to the waste collection centres location problem (Q2214188) (← links)
- Curriculum-based course timetabling with student flow, soft constraints, and smoothing objectives: an application to a real case study (Q2225651) (← links)
- Recognizing Helly edge-path-tree graphs and their clique graphs (Q2275917) (← links)
- Location of differentiated waste collection centers with user cooperation: a bilevel optimization approach (Q2300640) (← links)
- On the Galois lattice of bipartite distance hereditary graphs (Q2352777) (← links)
- CHECKCOL: improved local search for graph coloring (Q2458929) (← 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)
- A decomposition approach to solve a bilevel capacitated facility location problem with equity constraints (Q2629907) (← links)
- Solving the minimum-weighted coloring problem (Q2748384) (← links)
- An economic model for resource allocation in grid computing (Q2879492) (← links)
- Novel local-search-based approaches to university examination timetabling (Q2900997) (← links)
- On the Galois Lattice of Bipartite Distance Hereditary Graphs (Q2946040) (← links)
- A new formulation of the resource-unconstrained project scheduling problem with generalized precedence relations to minimize the completion time (Q3064043) (← links)
- (Q3070858) (← links)
- Grid scheduling by on-line rectangle packing (Q3156825) (← 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)
- On the selection of k routes in multiobjective hazmat route planning (Q3576298) (← links)
- A heuristic approach for the truck and trailer routing problem (Q3585726) (← links)
- Integrality Properties of Certain Special Balanceable Families (Q3651533) (← links)
- (Q4426345) (← links)
