The following pages link to Maria Grazia Speranza (Q835556):
Displayed 50 items.
- An approximation result for a duo-processor task scheduling problem (Q286992) (← links)
- A 13/12 approximation algorithm for bin packing with extendable bins (Q293250) (← links)
- A heuristic for BILP problems: the single source capacitated facility location problem (Q296777) (← links)
- Linear programming models based on omega ratio for the enhanced index tracking problem (Q322803) (← links)
- A survey on two-echelon routing problems (Q337424) (← links)
- An ILP-refined tabu search for the directed profitable rural postman problem (Q406489) (← links)
- Kernel search: an application to the index tracking problem (Q439324) (← links)
- Reoptimizing the rural postman problem (Q502442) (← links)
- Semi on-line scheduling on three processors with known sum of the tasks (Q835557) (← links)
- Item:Q835556 (redirect page) (← links)
- Item:Q1194727 (redirect page) (← links)
- Production scheduling problems in a textile industry (Q1194728) (← links)
- Scheduling multiprocessor tasks on three dedicated processors (Q1197982) (← links)
- Semi on-line algorithms for the partition problem (Q1267197) (← links)
- On-line approximation algorithms for scheduling tasks on identical machines with extendable working time (Q1290163) (← links)
- Approximation algorithms for partitioning small items in unequal bins to minimize the total size (Q1293199) (← links)
- Heuristic algorithms for the portfolio selection problem with minimum transaction lots (Q1296348) (← links)
- Corrigendum to: ``Scheduling multiprocessor tasks on three dedicated processors'' (Q1318754) (← links)
- A decomposition approach for a resource constrained scheduling problem (Q1333515) (← links)
- A decomposition approach in a DSS for a resource constrained scheduling problem (Q1342055) (← links)
- Efficiency and effectiveness of normal schedules on three dedicated processors (Q1356693) (← links)
- An efficient fully polynomial approximation scheme for the Subset-Sum problem. (Q1400576) (← links)
- Semi-absolute deviation rule for mutual funds portfolio selection (Q1417785) (← links)
- Rounding procedures for the discrete version of the capacitated economic order quantity problem (Q1599326) (← links)
- The periodic vehicle routing problem with intermediate facilities (Q1600833) (← links)
- Congestion avoiding heuristic path generation for the proactive route guidance (Q1654374) (← links)
- Adaptive kernel search: a heuristic for solving mixed integer linear programs (Q1694819) (← links)
- Bridging \(k\)-sum and CVaR optimization in MILP (Q1722975) (← links)
- The value of integrating loading and routing (Q1752774) (← links)
- Semi-on-line scheduling on two parallel processors with an upper bound on the items (Q1762979) (← links)
- Improved rounding procedures for the discrete version of the capacitated EOQ problem (Q1779529) (← links)
- Optimal solutions for routing problems with profits (Q1941380) (← links)
- Two linear approximation algorithms for the subset-sum problem (Q1969831) (← links)
- A trade-off between average and maximum arc congestion minimization in traffic assignment with user constraints (Q2002850) (← links)
- On single-source capacitated facility location with cost and fairness objectives (Q2029269) (← links)
- System optimal routing of traffic flows with user constraints using linear programming (Q2030327) (← links)
- The distance constrained multiple vehicle traveling purchaser problem (Q2256245) (← links)
- Dynamic traveling salesman problem with stochastic release dates (Q2327624) (← links)
- The on-line multiprocessor scheduling problem with known sum of the tasks (Q2464434) (← links)
- Competitive analysis of a dispatch policy for a dynamic multi-period routing problem (Q2467440) (← links)
- Semi-online scheduling on two uniform processors (Q2481966) (← links)
- Minimizing the total travel time with limited unfairness in traffic networks (Q2664349) (← links)
- A kernel search heuristic for a fair facility location problem (Q2668732) (← links)
- The split delivery capacitated team orienteering problem (Q2811321) (← links)
- Exact and Heuristic Solutions for a Shipment Problem with Given Frequencies (Q3116771) (← links)
- (Q3151785) (← links)
- (Q3158088) (← links)
- The capacitated team orienteering and profitable tour problems (Q3184456) (← links)
- Analysis of practical policies for a single link distribution system (Q3524587) (← links)
- Geometric representation for semi on-line scheduling on uniform processors (Q3562411) (← links)
- Inventory Routing (Q3564349) (← links)