The following pages link to Mauro Dell'Amico (Q193677):
Displaying 50 items.
- (Q342354) (redirect page) (← links)
- A destroy and repair algorithm for the bike sharing rebalancing problem (Q342356) (← links)
- Lower and upper bounds for the bin packing problem with fragile objects (Q406499) (← links)
- Lower bounds and heuristic algorithms for the \(k_i\)-partitioning problem (Q819064) (← links)
- The single-finger keyboard layout problem (Q1025249) (← links)
- (Q1043362) (redirect page) (← links)
- Heuristic algorithms for the multi-depot ring-star problem (Q1043363) (← links)
- Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading (Q1046716) (← links)
- A Lagrangian heuristic for the Prize Collecting Travelling Salesman Problem (Q1265891) (← links)
- Reduction of the three-partition problem (Q1304381) (← links)
- A lower bound for the non-oriented two-dimensional bin packing problem (Q1348248) (← links)
- The \(k\)-cardinality assignment problem (Q1363745) (← links)
- (Q1406680) (redirect page) (← links)
- New bounds for optimum traffic assignment in satellite communication. (Q1406681) (← links)
- Combining linear and nonlinear objectives in spanning tree problems (Q1583705) (← links)
- Solution of large weighted equicut problems (Q1609912) (← links)
- Exact algorithms for the bin packing problem with fragile objects (Q1662100) (← links)
- Scheduling cleaning activities on trains by minimizing idle times (Q1707827) (← links)
- Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines (Q1711446) (← links)
- On total \(f\)-domination: polyhedral and algorithmic results (Q1732100) (← links)
- Mathematical models and decomposition methods for the multiple knapsack problem (Q1755383) (← links)
- Solution of the cumulative assignment problem with a well-structured tabu search method (Q1806772) (← links)
- The base-matroid and inverse combinatorial optimization problems. (Q1811117) (← links)
- Minimizing the sum of weighted completion times with unrestricted weights (Q1902889) (← links)
- On some multicriteria arborescence problems: Complexity and algorithms (Q1917271) (← links)
- Open shop, satellite communication and a theorem by Egerváry (1931) (Q1919192) (← links)
- Algorithms and codes for dense assignment problems: The state of the art (Q1962018) (← links)
- Exact solution of the SONET ring loading problem (Q1962832) (← links)
- Drone-assisted deliveries: new formulations for the flying sidekick traveling salesman problem (Q2037887) (← links)
- Matheuristic algorithms for the parallel drone scheduling traveling salesman problem (Q2158611) (← links)
- On \(f\)-domination: polyhedral and algorithmic results (Q2274147) (← links)
- A branch-and-price algorithm for the temporal bin packing problem (Q2337386) (← links)
- Friendly bin packing instances without integer round-up property (Q2340275) (← links)
- Applying tabu search to the job-shop scheduling problem (Q2367003) (← links)
- Shortest paths in piecewise continuous time-dependent networks (Q2517795) (← links)
- Comparing metaheuristic algorithms for SONET network design problems (Q2573001) (← links)
- Scheduling jobs with release dates on identical parallel machines by minimizing the total weighted completion time (Q2664351) (← links)
- Heuristic and Exact Algorithms for the Identical Parallel Machine Scheduling Problem (Q2901015) (← links)
- Combinatorial Benders' Cuts for the Strip Packing Problem (Q2935306) (← links)
- Heuristic Algorithms for the Multiple Depot Vehicle Scheduling Problem (Q3134567) (← links)
- The Capacitated <i>m</i>-Ring-Star Problem (Q3392143) (← links)
- Assignment Problems (Q3531417) (← links)
- A branch and bound algorithm for the multiple depot vehicle scheduling problem (Q3826353) (← links)
- Shop Problems With Two Machines and Time Lags (Q4345598) (← links)
- (Q4350061) (← links)
- (Q4350084) (← links)
- Exact solution of large-scale, asymmetric traveling salesman problems (Q4371607) (← links)
- Algorithm 750: CDT (Q4371613) (← links)
- (Q4398377) (← links)
- A linear time algorithm for scheduling outforests with communication delays on three processors (Q4805397) (← links)
