- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j61 |      | Claudia Archetti, Gianfranco Guastaroba, Maria Grazia Speranza: Reoptimizing the rural postman problem. Computers & OR 40(5): 1306-1313 (2013) |
| j60 | | Claudia Archetti, Nicola Bianchessi, Maria Grazia Speranza: Optimal solutions for routing problems with profits. Discrete Applied Mathematics 161(4-5): 547-557 (2013) |
| j59 | | Francesco Carrabs, Raffaele Cerulli, Maria Grazia Speranza: A branch-and-bound algorithm for the double travelling salesman problem with two stacks. Networks 61(1): 58-75 (2013) |
| 2012 | ||
| j58 | | Enrico Angelelli, Renata Mansini, Maria Grazia Speranza: Kernel Search: a new heuristic framework for portfolio selection. Comp. Opt. and Appl. 51(1): 345-361 (2012) |
| j57 | | Gianfranco Guastaroba, Maria Grazia Speranza: Kernel Search: An application to the index tracking problem. European Journal of Operational Research 217(1): 54-68 (2012) |
| j56 | | Gianfranco Guastaroba, Maria Grazia Speranza: Kernel search for the capacitated facility location problem. J. Heuristics 18(6): 877-917 (2012) |
| j55 | | Claudia Archetti, Luca Bertazzi, Alain Hertz, Maria Grazia Speranza: A Hybrid Heuristic for an Inventory Routing Problem. INFORMS Journal on Computing 24(1): 101-116 (2012) |
| j54 | | Renata Mansini, Maria Grazia Speranza: CORAL: An Exact Algorithm for the Multidimensional Knapsack Problem. INFORMS Journal on Computing 24(3): 399-415 (2012) |
| j53 | | Jean-François Côté, Claudia Archetti, Maria Grazia Speranza, Michel Gendreau, Jean-Yves Potvin: A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks. Networks 60(4): 212-226 (2012) |
| 2011 | ||
| j52 | | Claudia Archetti, Luca Bertazzi, Giuseppe Paletta, Maria Grazia Speranza: Analysis of the maximum level policy in a production-distribution system. Computers & OR 38(12): 1731-1746 (2011) |
| j51 | | György Dósa, Maria Grazia Speranza, Zsolt Tuza: Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi on-line scheduling. J. Comb. Optim. 21(4): 458-480 (2011) |
| j50 | | Claudia Archetti, Nicola Bianchessi, Maria Grazia Speranza: A column generation approach for the split delivery vehicle routing problem. Networks 58(4): 241-254 (2011) |
| 2010 | ||
| j49 | | Claudia Archetti, Dominique Feillet, Alain Hertz, Maria Grazia Speranza: The undirected capacitated arc routing problem with profits. Computers & OR 37(11): 1860-1869 (2010) |
| j48 | | Enrico Angelelli, Renata Mansini, Maria Grazia Speranza: Kernel search: A general heuristic for the multi-dimensional knapsack problem. Computers & OR 37(11): 2017-2026 (2010) |
| j47 | | Claudia Archetti, Luca Bertazzi, Maria Grazia Speranza: Reoptimizing the 0-1 knapsack problem. Discrete Applied Mathematics 158(17): 1879-1887 (2010) |
| j46 | | Enrico Angelelli, Nicola Bianchessi, Renata Mansini, Maria Grazia Speranza: Comparison of policies in dynamic routing problems. JORS 61(4): 686-695 (2010) |
| j45 | | Hanne L. Petersen, Claudia Archetti, Maria Grazia Speranza: Exact solutions to the double travelling salesman problem with multiple stacks. Networks 56(4): 229-243 (2010) |
| j44 | | Enrico Angelelli, Maria Grazia Speranza, József Szoldatics, Zsolt Tuza: Geometric representation for semi on-line scheduling on uniform processors. Optimization Methods and Software 25(3): 421-428 (2010) |
| 2009 | ||
| j43 | | 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) |
| j42 | | Claudia Archetti, Dominique Feillet, Alain Hertz, Maria Grazia Speranza: The capacitated team orienteering and profitable tour problems. JORS 60(6): 831-842 (2009) |
| 2008 | ||
| j41 | | Enrico Angelelli, Maria Grazia Speranza, Zsolt Tuza: Semi-online scheduling on two uniform processors. Theor. Comput. Sci. 393(1-3): 211-219 (2008) |
| j40 | | Claudia Archetti, Maria Grazia Speranza, Martin W. P. Savelsbergh: An Optimization-Based Heuristic for the Split Delivery Vehicle Routing Problem. Transportation Science 42(1): 22-31 (2008) |
| 2007 | ||
| j39 | | 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) |
| j38 | | Paolo Dell'Olmo, Raffaele Pesenti, Maria Grazia Speranza: Editorial. Computers & OR 34(6): 1515 (2007) |
| j37 | | Claudia Archetti, Alain Hertz, Maria Grazia Speranza: Metaheuristics for the team orienteering problem. J. Heuristics 13(1): 49-76 (2007) |
| j36 | | Enrico Angelelli, Maria Grazia Speranza, Martin W. P. Savelsbergh: Competitive analysis for dynamic multiperiod uncapacitated routing problems. Networks 49(4): 308-317 (2007) |
| j35 | | 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) |
| j34 | | Claudia Archetti, Luca Bertazzi, Gilbert Laporte, Maria Grazia Speranza: A Branch-and-Cut Algorithm for a Vendor-Managed Inventory-Routing Problem. Transportation Science 41(3): 382-391 (2007) |
| 2006 | ||
| j33 | | |
| j32 | | 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) |
| j31 | | Claudia Archetti, Maria Grazia Speranza, Alain Hertz: A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem. Transportation Science 40(1): 64-73 (2006) |
| j30 | | Claudia Archetti, Martin W. P. Savelsbergh, Maria Grazia Speranza: Worst-Case Analysis for Split Delivery Vehicle Routing Problems. Transportation Science 40(2): 226-234 (2006) |
| c2 | | Claudia Archetti, Maria Grazia Speranza: An Overview on the Split Delivery Vehicle Routing Problem. OR 2006: 123-127 |
| 2005 | ||
| j29 | | 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) |
| j28 | | 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) |
| j27 | | Claudia Archetti, Renata Mansini, Maria Grazia Speranza: Complexity and Reducibility of the Skip Delivery Problem. Transportation Science 39(2): 182-187 (2005) |
| 2004 | ||
| j26 | | Luca Bertazzi, Giuseppe Paletta, Maria Grazia Speranza: An improved heuristic for the period traveling salesman problem. Computers & OR 31(8): 1215-1222 (2004) |
| j25 | | 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) |
| j24 | | 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 | ||
| j23 | | 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) |
| j22 | | Luca Chiodi, Renata Mansini, Maria Grazia Speranza: Semi-Absolute Deviation Rule for Mutual Funds Portfolio Selection. Annals OR 124(1-4): 245-265 (2003) |
| j21 | | Renata Mansini, Wlodzimierz Ogryczak, Maria Grazia Speranza: On LP Solvable Models for Portfolio Selection. Informatica, Lith. Acad. Sci. 14(1): 37-62 (2003) |
| j20 | | 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) |
| j19 | | Claudia Archetti, Luca Bertazzi, Maria Grazia Speranza: Reoptimizing the traveling salesman problem. Networks 42(3): 154-159 (2003) |
| 2002 | ||
| j18 | | Enrico Angelelli, Maria Grazia Speranza: The periodic vehicle routing problem with intermediate facilities. European Journal of Operational Research 137(2): 233-247 (2002) |
| j17 | | Luca Bertazzi, Giuseppe Paletta, Maria Grazia Speranza: Deterministic Order-Up-To Level Policies in an Inventory Routing Problem. Transportation Science 36(1): 119-132 (2002) |
| j16 | | Luca Bertazzi, Maria Grazia Speranza: Continuous and Discrete Shipping Strategies for the Single Link Problem. Transportation Science 36(3): 314-325 (2002) |
| 2001 | ||
| j15 | | 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) |
| 2000 | ||
| j14 | | Hans Kellerer, Renata Mansini, Maria Grazia Speranza: Two linear approximation algorithms for the subset-sum problem. European Journal of Operational Research 120(2): 289-296 (2000) |
| 1999 | ||
| j13 | | 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) |
| j12 | | Renata Mansini, Maria Grazia Speranza: Heuristic algorithms for the portfolio selection problem with minimum transaction lots. European Journal of Operational Research 114(2): 219-233 (1999) |
| 1998 | ||
| j11 | | Renata Mansini, Maria Grazia Speranza: A linear programming model for the separate refuse collection service. Computers & OR 25(7-8): 659-673 (1998) |
| j10 | | 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 | ||
| j9 | | Rolf H. Möhring, Franz Josef Radermacher, Maria Grazia Speranza: Scheduling at Villa Vigoni. Discrete Applied Mathematics 72(1-2): 1-3 (1997) |
| j8 | | 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) |
| j7 | | 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) |
| j6 | | 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) |
| j5 | | 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) |
| c1 | | Hans Kellerer, Ulrich Pferschy, Maria Grazia Speranza: An Efficient Approximation Scheme for the Subset-Sum Problem. ISAAC 1997: 394-403 |
| 1996 | ||
| j4 | | 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 | ||
| j3 | | Lucio Bianco, Paolo Dell'Olmo, Maria Grazia Speranza: Scheduling Independent Tasks with Multiple Modes. Discrete Applied Mathematics 62(1-3): 35-50 (1995) |
| 1994 | ||
| j2 |  | 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 | ||
| j1 | | 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) |
Colors in the list of coauthors
Last update Fri May 24 22:58:42 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page