2009 |
34 | EE | Gianfranco Guastaroba,
Renata Mansini,
Maria Grazia Speranza:
On the effectiveness of scenario generation techniques in single-period portfolio optimization.
European Journal of Operational Research 192(2): 500-511 (2009) |
2008 |
33 | EE | Enrico Angelelli,
Maria Grazia Speranza,
Zsolt Tuza:
Semi-online scheduling on two uniform processors.
Theor. Comput. Sci. 393(1-3): 211-219 (2008) |
2007 |
32 | EE | Renata Mansini,
Wlodzimierz Ogryczak,
Maria Grazia Speranza:
Conditional value at risk and related linear programming models for portfolio optimization.
Annals OR 152(1): 227-256 (2007) |
31 | EE | Paolo Dell'Olmo,
Raffaele Pesenti,
Maria Grazia Speranza:
Editorial.
Computers & OR 34(6): 1515 (2007) |
30 | EE | Claudia Archetti,
Alain Hertz,
Maria Grazia Speranza:
Metaheuristics for the team orienteering problem.
J. Heuristics 13(1): 49-76 (2007) |
29 | EE | Enrico Angelelli,
Maria Grazia Speranza,
Martin W. P. Savelsbergh:
Competitive analysis for dynamic multiperiod uncapacitated routing problems.
Networks 49(4): 308-317 (2007) |
28 | EE | Enrico Angelelli,
Martin W. P. Savelsbergh,
Maria Grazia Speranza:
Competitive analysis of a dispatch policy for a dynamic multi-period routing problem.
Oper. Res. Lett. 35(6): 713-721 (2007) |
2006 |
27 | EE | Claudia Archetti,
Maria Grazia Speranza:
An Overview on the Split Delivery Vehicle Routing Problem.
OR 2006: 123-127 |
26 | EE | Martine Labbé,
José Paixão,
Maria Grazia Speranza:
Preface.
Annals OR 144(1): 1 (2006) |
25 | EE | Enrico Angelelli,
Maria Grazia Speranza,
Zsolt Tuza:
New bounds and algorithms for on-line scheduling: two identical processors, known sum and upper bound on the tasks.
Discrete Mathematics & Theoretical Computer Science 8(1): 1-16 (2006) |
2005 |
24 | EE | Luca Bertazzi,
Maria Grazia Speranza:
Improved rounding procedures for the discrete version of the capacitated EOQ problem.
European Journal of Operational Research 166(1): 25-34 (2005) |
23 | EE | Luca Bertazzi,
Giuseppe Paletta,
Maria Grazia Speranza:
Minimizing the Total Cost in an Integrated Vendor - Managed Inventory System.
J. Heuristics 11(5-6): 393-419 (2005) |
2004 |
22 | EE | Luca Bertazzi,
Giuseppe Paletta,
Maria Grazia Speranza:
An improved heuristic for the period traveling salesman problem.
Computers & OR 31(8): 1215-1222 (2004) |
21 | EE | Renata Mansini,
Maria Grazia Speranza,
Zsolt Tuza:
Scheduling groups of tasks with precedence constraints on three dedicated processors.
Discrete Applied Mathematics 134(1-3): 141-168 (2004) |
20 | EE | Enrico Angelelli,
Á. B. Nagy,
Maria Grazia Speranza,
Zsolt Tuza:
The On-Line Multiprocessor Scheduling Problem with Known Sum of the Tasks.
J. Scheduling 7(6): 421-428 (2004) |
2003 |
19 | EE | Enrico Angelelli,
Maria Grazia Speranza,
Zsolt Tuza:
Semi-On-line Scheduling on Two Parallel Processors with an Upper Bound on the Items.
Algorithmica 37(4): 243-262 (2003) |
18 | EE | Luca Chiodi,
Renata Mansini,
Maria Grazia Speranza:
Semi-Absolute Deviation Rule for Mutual Funds Portfolio Selection.
Annals OR 124(1-4): 245-265 (2003) |
17 | EE | Renata Mansini,
Wlodzimierz Ogryczak,
Maria Grazia Speranza:
On LP Solvable Models for Portfolio Selection.
Informatica, Lith. Acad. Sci. 14(1): 37-62 (2003) |
16 | EE | Hans Kellerer,
Renata Mansini,
Ulrich Pferschy,
Maria Grazia Speranza:
An efficient fully polynomial approximation scheme for the Subset-Sum Problem.
J. Comput. Syst. Sci. 66(2): 349-370 (2003) |
15 | EE | Claudia Archetti,
Luca Bertazzi,
Maria Grazia Speranza:
Reoptimizing the traveling salesman problem.
Networks 42(3): 154-159 (2003) |
2001 |
14 | EE | Luca Bertazzi,
Maria Grazia Speranza:
Rounding Procedures for the Discrete Version of the Capacitated Economic Order Quantity Problem.
Annals OR 107(1-4): 33-49 (2001) |
1999 |
13 | EE | Paolo Dell'Olmo,
Maria Grazia Speranza:
Approximation Algorithms for Partitioning Small Items in Unequal Bins to Minimize the Total Size.
Discrete Applied Mathematics 94(1-3): 181-191 (1999) |
1998 |
12 | EE | Renata Mansini,
Maria Grazia Speranza:
A linear programming model for the separate refuse collection service.
Computers & OR 25(7-8): 659-673 (1998) |
11 | EE | Paolo Dell'Olmo,
Hans Kellerer,
Maria Grazia Speranza,
Zsolt Tuza:
A 13/12 Approximation Algorithm for Bin Packing with Extendable Bins.
Inf. Process. Lett. 65(5): 229-233 (1998) |
1997 |
10 | | Hans Kellerer,
Ulrich Pferschy,
Maria Grazia Speranza:
An Efficient Approximation Scheme for the Subset-Sum Problem.
ISAAC 1997: 394-403 |
9 | EE | Rolf H. Möhring,
Franz Josef Radermacher,
Maria Grazia Speranza:
Scheduling at Villa Vigoni.
Discrete Applied Mathematics 72(1-2): 1-3 (1997) |
8 | EE | Paolo Dell'Olmo,
Maria Grazia Speranza,
Zsolt Tuza:
Comparability Graph Augmentation for some Multiprocessor Scheduling Problems.
Discrete Applied Mathematics 72(1-2): 71-84 (1997) |
7 | EE | Paolo Dell'Olmo,
Maria Grazia Speranza,
Zsolt Tuza:
Efficiency and effectiveness of normal schedules on three dedicated processors.
Discrete Mathematics 164(1-3): 67-79 (1997) |
6 | EE | Paolo Dell'Olmo,
Stefano Giordani,
Maria Grazia Speranza:
An Approximation Result for a Duo-Processor Task Scheduling Problem.
Inf. Process. Lett. 61(4): 195-200 (1997) |
5 | EE | Hans Kellerer,
Vladimir Kotov,
Maria Grazia Speranza,
Zsolt Tuza:
Semi on-line algorithms for the partition problem.
Oper. Res. Lett. 21(5): 235-242 (1997) |
1996 |
4 | EE | Maria Grazia Speranza:
A heuristic algorithm for a portfolio optimization model applied to the Milan stock market.
Computers & OR 23(5): 433-441 (1996) |
1995 |
3 | EE | Lucio Bianco,
Paolo Dell'Olmo,
Maria Grazia Speranza:
Scheduling Independent Tasks with Multiple Modes.
Discrete Applied Mathematics 62(1-3): 35-50 (1995) |
1994 |
2 | | Jacek Blazewicz,
Paolo Dell'Olmo,
Maciej Drozdowski,
Maria Grazia Speranza:
Corrigendum: Scheduling Multiprocessor Tasks on Three Dedicated Processors.
Inf. Process. Lett. 49(5): 269-270 (1994) |
1992 |
1 | | Jacek Blazewicz,
Paolo Dell'Olmo,
Maciej Drozdowski,
Maria Grazia Speranza:
Scheduling Multiprocessor Tasks on Three Dedicated Processors.
Inf. Process. Lett. 41(5): 275-280 (1992) |