The following pages link to Roberto Cordone (Q188434):
Displaying 39 items.
- A GRASP metaheuristic for microarray data analysis (Q336713) (← links)
- The multimode covering location problem (Q342251) (← links)
- Solving the quadratic minimum spanning tree problem (Q387698) (← links)
- Multimode extensions of combinatorial optimization problems (Q510906) (← links)
- Partitioning a graph into minimum gap components (Q510915) (← links)
- The prize-collecting scheduling problem with deadlines (Q510929) (← links)
- Construction and improvement algorithms for dispersion problems (Q726217) (← links)
- An exact algorithm for the node weighted Steiner tree problem (Q876575) (← links)
- A variable neighborhood search algorithm for the multimode set covering problem (Q887195) (← links)
- Tabu search versus GRASP for the maximum diversity problem (Q926570) (← links)
- On the complexity of graph tree partition problems. (Q1421460) (← links)
- A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization (Q1628126) (← links)
- (Q1868810) (redirect page) (← links)
- A heuristic approach to the overnight security service problem (Q1868811) (← links)
- An integer optimization approach for reverse engineering of gene regulatory networks (Q1941384) (← links)
- On finding connected balanced partitions of trees (Q2028065) (← links)
- Maximum feasible subsystems of distance geometry constraints (Q2131137) (← links)
- A branch and bound approach for the design of decentralized supervisors in Petri net models (Q2342792) (← links)
- Integrated design of optimal supervisors for the enforcement of static and behavioral specifications in Petri net models (Q2350813) (← links)
- Column-generation based bounds for the homogeneous areas problem (Q2356280) (← links)
- A subexponential algorithm for the coloured tree partition problem (Q2370434) (← links)
- Employee workload balancing by graph partitioning (Q2448894) (← links)
- Balanced compact clustering for efficient range queries in metric spaces (Q2449057) (← links)
- Solving the swath segment selection problem through Lagrangean relaxation (Q2456644) (← links)
- Optimal selection of contracts and work shifts in multi-skill call centers (Q2513755) (← links)
- Metaheuristics for the minimum gap graph partitioning problem (Q2668747) (← links)
- Cardinality constrained connected balanced partitions of trees under different criteria (Q2684048) (← links)
- (Q2771641) (← links)
- (Q3061335) (← links)
- (Q3070929) (← links)
- The Multicommodity Multilevel Bottleneck Assignment Problem (Q3439124) (← links)
- The demand-dependent optimization of regular train timetables (Q3439137) (← links)
- A RELAX-AND-CUT ALGORITHM FOR THE KNAPSACK NODE WEIGHTED STEINER TREE PROBLEM (Q3526525) (← links)
- Supervisory Control of Timed Discrete-Event Systems With Logical and Temporal Specifications (Q5092184) (← links)
- A Branch-and-Bound Algorithm for the Prize-Collecting Single-Machine Scheduling Problem with Deadlines and Total Tardiness Minimization (Q5131718) (← links)
- Designing Optimal Deadlock Avoidance Policies for Sequential Resource Allocation Systems Through Classification Theory: Existence Results and Customized Algorithms (Q5353394) (← links)
- A heuristic for the vehicle routing problem with time windows (Q5937017) (← links)
- Constructive-destructive heuristics for the safe set problem (Q6047845) (← links)
- A combinatorial branch and bound for the safe set problem (Q6179692) (← links)
