The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Maria Grazia Speranza: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Hans Kellerer, Ulrich Pferschy, Maria Grazia Speranza
    An Efficient Approximation Scheme for the Subset-Sum Problem. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1997, pp:394-403 [Conf]
  2. Enrico Angelelli, Maria Grazia Speranza, Zsolt Tuza
    Semi-On-line Scheduling on Two Parallel Processors with an Upper Bound on the Items. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2003, v:37, n:4, pp:243-262 [Journal]
  3. Luca Bertazzi, Giuseppe Paletta, Maria Grazia Speranza
    An improved heuristic for the period traveling salesman problem. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2004, v:31, n:8, pp:1215-1222 [Journal]
  4. Renata Mansini, Maria Grazia Speranza
    A linear programming model for the separate refuse collection service. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 1998, v:25, n:7-8, pp:659-673 [Journal]
  5. Maria Grazia Speranza
    A heuristic algorithm for a portfolio optimization model applied to the Milan stock market. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 1996, v:23, n:5, pp:433-441 [Journal]
  6. Paolo Dell'Olmo, Raffaele Pesenti, Maria Grazia Speranza
    Editorial. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2007, v:34, n:6, pp:1515- [Journal]
  7. Lucio Bianco, Paolo Dell'Olmo, Maria Grazia Speranza
    Scheduling Independent Tasks with Multiple Modes. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:62, n:1-3, pp:35-50 [Journal]
  8. Paolo Dell'Olmo, Maria Grazia Speranza
    Approximation Algorithms for Partitioning Small Items in Unequal Bins to Minimize the Total Size. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:94, n:1-3, pp:181-191 [Journal]
  9. Paolo Dell'Olmo, Maria Grazia Speranza, Zsolt Tuza
    Comparability Graph Augmentation for some Multiprocessor Scheduling Problems. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:72, n:1-2, pp:71-84 [Journal]
  10. Renata Mansini, Maria Grazia Speranza, Zsolt Tuza
    Scheduling groups of tasks with precedence constraints on three dedicated processors. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:134, n:1-3, pp:141-168 [Journal]
  11. Rolf H. Möhring, Franz Josef Radermacher, Maria Grazia Speranza
    Scheduling at Villa Vigoni. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:72, n:1-2, pp:1-3 [Journal]
  12. Luca Bertazzi, Giuseppe Paletta, Maria Grazia Speranza
    Minimizing the Total Cost in an Integrated Vendor - Managed Inventory System. [Citation Graph (0, 0)][DBLP]
    J. Heuristics, 2005, v:11, n:5-6, pp:393-419 [Journal]
  13. Claudia Archetti, Alain Hertz, Maria Grazia Speranza
    Metaheuristics for the team orienteering problem. [Citation Graph (0, 0)][DBLP]
    J. Heuristics, 2007, v:13, n:1, pp:49-76 [Journal]
  14. Renata Mansini, Wlodzimierz Ogryczak, Maria Grazia Speranza
    On LP Solvable Models for Portfolio Selection. [Citation Graph (0, 0)][DBLP]
    Informatica, Lith. Acad. Sci., 2003, v:14, n:1, pp:37-62 [Journal]
  15. Jacek Blazewicz, Paolo Dell'Olmo, Maciej Drozdowski, Maria Grazia Speranza
    Scheduling Multiprocessor Tasks on Three Dedicated Processors. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:41, n:5, pp:275-280 [Journal]
  16. Jacek Blazewicz, Paolo Dell'Olmo, Maciej Drozdowski, Maria Grazia Speranza
    Corrigendum: Scheduling Multiprocessor Tasks on Three Dedicated Processors. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:49, n:5, pp:269-270 [Journal]
  17. Paolo Dell'Olmo, Stefano Giordani, Maria Grazia Speranza
    An Approximation Result for a Duo-Processor Task Scheduling Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:61, n:4, pp:195-200 [Journal]
  18. Paolo Dell'Olmo, Hans Kellerer, Maria Grazia Speranza, Zsolt Tuza
    A 13/12 Approximation Algorithm for Bin Packing with Extendable Bins. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:65, n:5, pp:229-233 [Journal]
  19. Hans Kellerer, Renata Mansini, Ulrich Pferschy, Maria Grazia Speranza
    An efficient fully polynomial approximation scheme for the Subset-Sum Problem. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2003, v:66, n:2, pp:349-370 [Journal]
  20. Claudia Archetti, Luca Bertazzi, Maria Grazia Speranza
    Reoptimizing the traveling salesman problem. [Citation Graph (0, 0)][DBLP]
    Networks, 2003, v:42, n:3, pp:154-159 [Journal]
  21. Hans Kellerer, Vladimir Kotov, Maria Grazia Speranza, Zsolt Tuza
    Semi on-line algorithms for the partition problem. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 1997, v:21, n:5, pp:235-242 [Journal]
  22. Enrico Angelelli, Á. B. Nagy, Maria Grazia Speranza, Zsolt Tuza
    The On-Line Multiprocessor Scheduling Problem with Known Sum of the Tasks. [Citation Graph (0, 0)][DBLP]
    J. Scheduling, 2004, v:7, n:6, pp:421-428 [Journal]
  23. Luca Bertazzi, Maria Grazia Speranza
    Improved rounding procedures for the discrete version of the capacitated EOQ problem. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2005, v:166, n:1, pp:25-34 [Journal]
  24. Paolo Dell'Olmo, Maria Grazia Speranza, Zsolt Tuza
    Efficiency and effectiveness of normal schedules on three dedicated processors. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:164, n:1-3, pp:67-79 [Journal]
  25. 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. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2006, v:8, n:1, pp:1-16 [Journal]

  26. An Overview on the Split Delivery Vehicle Routing Problem. [Citation Graph (, )][DBLP]


  27. Kernel search: A general heuristic for the multi-dimensional knapsack problem. [Citation Graph (, )][DBLP]


  28. The undirected capacitated arc routing problem with profits. [Citation Graph (, )][DBLP]


Search in 0.017secs, Finished in 0.019secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002