The following pages link to Roberto Tadei (Q212077):
Displaying 50 items.
- The stochastic generalized bin packing problem (Q423955) (← links)
- The three-dimensional knapsack problem with balancing constraints (Q440966) (← links)
- Branch-and-price and beam search algorithms for the variable cost and size bin packing problem with optional items (Q490206) (← links)
- New bin packing fast lower bounds (Q883309) (← links)
- EVE-OPT: a hybrid algorithm for the capacitated vehicle routing problem (Q953302) (← links)
- The stochastic \(p\)-median problem with unknown cost probability distribution (Q1015317) (← links)
- Real time task scheduling allowing fuzzy due dates (Q1278126) (← links)
- (Q1309973) (redirect page) (← links)
- Cellular control of manufacturing systems (Q1309976) (← links)
- A multi-KP modeling for the maximum-clique problem (Q1328650) (← links)
- A genetic algorithm for the job shop problem (Q1342314) (← links)
- Aggregate planning and scheduling in the food industry: A case study (Q1390328) (← links)
- A greedy-based neighborhood search approach to a nurse rostering problem. (Q1417481) (← links)
- An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem (Q1433664) (← links)
- Real-time task scheduling with fuzzy deadlines and processing times (Q1595194) (← links)
- An improved branch-and-bound algorithm for the two machine total completion time flow shop problem (Q1604072) (← links)
- Customized multi-period stochastic assignment problem for social engagement and opportunistic IoT (Q1652577) (← links)
- A progressive hedging method for the optimization of social engagement and opportunistic IoT problems (Q1737502) (← links)
- New valid inequalities for the two-echelon capacitated vehicle routing problem (Q1742205) (← links)
- A generalized bin packing problem for parcel delivery in last-mile logistics (Q1755394) (← links)
- Recovering beam search: Enhancing the beam search approach for combinatorial optimization problems (Q1826491) (← links)
- The dynamic multilevel assignment problem as a stochastic extremal process (Q1847168) (← links)
- Finding the Pareto-optima for the total and maximum tardiness single machine problem (Q1850123) (← links)
- Scheduling a round robin tennis tournament under courts and players availability constraints (Q1960328) (← links)
- Minimizing tardy jobs in a flowshop with common due date (Q1969838) (← links)
- Stochastic single machine scheduling problem as a multi-stage dynamic random decision process (Q2051165) (← links)
- A hybrid algorithm for the vehicle routing problem with and/or precedence constraints and time windows (Q2147032) (← links)
- The multi-stage dynamic stochastic decision process with unknown distribution of the random utilities (Q2191290) (← links)
- TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem (Q2378415) (← links)
- The multi-Handler knapsack problem under uncertainty (Q2514753) (← links)
- Computing the asymptotic worst-case of bin packing lower bounds (Q2643960) (← links)
- The index selection problem with configurations and memory limitation: a scatter search approach (Q2668806) (← links)
- New families of valid inequalities for the two-echelon vehicle routing problem (Q2883630) (← links)
- Extreme point-based heuristics for three-dimensional bin packing (Q2901020) (← links)
- Solving the Hub location problem in telecommunication network design: A local search approach (Q3156824) (← links)
- Minimising makespan in the two-machine flow-shop with release times (Q3157644) (← links)
- A new decomposition approach for the single machine total tardiness scheduling problem (Q3157785) (← links)
- (Q3433143) (← links)
- (Q4289898) (← links)
- A Heuristic Algorithm for the Auto-Carrier Transportation Problem (Q4411210) (← links)
- (Q4452990) (← links)
- (Q4519503) (← links)
- Advanced search techniques for the job shop problem : a comparison (Q4846545) (← links)
- Minimizing the weighted sum of quadratic completion times on a single machine (Q4859582) (← links)
- The capacitated transshipment location problem with stochastic handling utilities at the facilities (Q4929090) (← links)
- Fuzzy scheduling with application to real-time systems (Q5947562) (← links)
- Optimal facility location with random throughput costs (Q5959384) (← links)
- Multiperiod transshipment location–allocation problem with flow synchronization under stochastic handling operations (Q6087146) (← links)
- The synchronized multi-commodity multi-service transshipment-hub location problem with cyclic schedules (Q6106592) (← links)
- Optimal Seating Assignment in the COVID-19 Era via Quantum Computing (Q6110176) (← links)
