default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMaria Grazia Speranza
M. Grazia Speranza
Person information
- affiliation: University of Brescia, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Journal Articles
- 2024
[j145]Enrico Angelelli, Valentina Morandi
, Maria Grazia Speranza:
Multi-day fair collaboration in demand-responsive transportation. Central Eur. J. Oper. Res. 32(2): 209-239 (2024)- [j144]Enrico Angelelli, Andrea Mor, Maria Grazia Speranza:
The one-station bike repositioning problem. Discret. Appl. Math. 357: 173-196 (2024) - [j143]Wenjuan Gu, Claudia Archetti, Diego Cattaruzza, Maxime Ogier, Frédéric Semet, M. Grazia Speranza:
Vehicle routing problems with multiple commodities: A survey. Eur. J. Oper. Res. 317(1): 1-15 (2024) - [j142]Laura A. Albert, Annunziata Esposito Amideo, Julia A. Bennell, Sally C. Brailsford, Paula Carroll, Ruth Kaufman, Katherine Kent, Kathy Kotiadis, Martin H. Kunc, Anna Nagurney, Frances A. O'Brien, Graham Rand, M. Grazia Speranza:
Commentary on Carroll & Esposito Amideo "Gender Equality: Opportunities and challenges for the OR community". J. Oper. Res. Soc. 75(6): 1030-1042 (2024) - 2023
- [j141]Claudia Archetti, Maurizio Bruglieri, Gianfranco Guastaroba, M. Grazia Speranza:
The benefit of complete trip information in free-floating carsharing systems. EURO J. Transp. Logist. 12: 100110 (2023) - [j140]Luce Brotcorne, Mario Guajardo, Celso C. Ribeiro, Maria Grazia Speranza:
Tutorials and Reviews in Operations Research. Int. Trans. Oper. Res. 30(6): 2707-2708 (2023) - [j139]Carlo Filippi, Gianfranco Guastaroba, Lorenzo Peirano, M. Grazia Speranza:
Trends in passenger transport optimisation. Int. Trans. Oper. Res. 30(6): 3057-3086 (2023) - [j138]Juan Carlos Martínez Mori, M. Grazia Speranza, Samitha Samaranayake:
On the Value of Dynamism in Transit Networks. Transp. Sci. 57(3): 578-593 (2023) - 2022
- [j137]Andrea Mor, Maria Grazia Speranza:
Vehicle routing problems over time: a survey. Ann. Oper. Res. 314(1): 255-275 (2022) - [j136]Wenjuan Gu, Claudia Archetti, Diego Cattaruzza, Maxime Ogier, Frédéric Semet, M. Grazia Speranza:
A sequential approach for a multi-commodity two-echelon distribution problem. Comput. Ind. Eng. 163: 107793 (2022) - [j135]Enrico Angelelli, Massimo Chiari, Andrea Mor, Maria Grazia Speranza:
A simulation framework for a station-based bike-sharing system. Comput. Ind. Eng. 171: 108489 (2022) - [j134]Claudia Archetti, Lorenzo Peirano, M. Grazia Speranza:
Optimization in multimodal freight transportation problems: A Survey. Eur. J. Oper. Res. 299(1): 1-20 (2022) - 2021
- [j133]Carlo Filippi, Gianfranco Guastaroba, Diana L. Huerta-Muñoz, Maria Grazia Speranza:
A kernel search heuristic for a fair facility location problem. Comput. Oper. Res. 132: 105292 (2021) - [j132]Carlo Filippi, Gianfranco Guastaroba, M. Grazia Speranza:
On single-source capacitated facility location with cost and fairness objectives. Eur. J. Oper. Res. 289(3): 959-974 (2021) - [j131]Enrico Angelelli, Valentina Morandi, Martin W. P. Savelsbergh, Maria Grazia Speranza:
System optimal routing of traffic flows with user constraints using linear programming. Eur. J. Oper. Res. 293(3): 863-879 (2021) - [j130]Claudia Archetti, Gianfranco Guastaroba, Diana L. Huerta-Muñoz, M. Grazia Speranza:
A kernel search heuristic for the multivehicle inventory routing problem. Int. Trans. Oper. Res. 28(6): 2984-3013 (2021) - 2020
- [j129]Andrea Mor, Maria Grazia Speranza:
Vehicle routing problems over time: a survey. 4OR 18(2): 129-149 (2020) - [j128]Gianfranco Guastaroba, Renata Mansini, Wlodzimierz Ogryczak, M. Grazia Speranza:
Enhanced index tracking with CVaR-based ratio measures. Ann. Oper. Res. 292(2): 883-931 (2020) - [j127]Enrico Angelelli, Valentina Morandi, Maria Grazia Speranza:
Minimizing the total travel time with limited unfairness in traffic networks. Comput. Oper. Res. 123: 105016 (2020) - [j126]Claudia Archetti, Dominique Feillet, Andrea Mor, Maria Grazia Speranza:
Dynamic traveling salesman problem with stochastic release dates. Eur. J. Oper. Res. 280(3): 832-844 (2020) - [j125]Claudia Archetti, M. Grazia Speranza, Maurizio Boccia, Antonio Sforza, Claudio Sterle:
A branch-and-cut algorithm for the inventory routing problem with pickups and deliveries. Eur. J. Oper. Res. 282(3): 886-895 (2020) - [j124]Carlo Filippi, Gianfranco Guastaroba, Maria Grazia Speranza:
Conditional value-at-risk beyond finance: a survey. Int. Trans. Oper. Res. 27(3): 1277-1319 (2020) - 2019
- [j123]Tino Henke, M. Grazia Speranza, Gerhard Wäscher:
A branch-and-cut algorithm for the multi-compartment vehicle routing problem with flexible compartment sizes. Ann. Oper. Res. 275(2): 321-338 (2019) - [j122]Carlo Filippi, Wlodzimierz Ogryczak, M. Grazia Speranza:
Bridging k-sum and CVaR optimization in MILP. Comput. Oper. Res. 105: 156-166 (2019) - [j121]Lars Dahle, Henrik Andersson, Marielle Christiansen, M. Grazia Speranza:
The pickup and delivery problem with time windows and occasional drivers. Comput. Oper. Res. 109: 122-133 (2019) - [j120]Enrico Angelelli, Valentina Morandi, Maria Grazia Speranza:
A trade-off between average and maximum arc congestion minimization in traffic assignment with user constraints. Comput. Oper. Res. 110: 88-100 (2019) - [j119]Homero Larrain, Leandro C. Coelho, Claudia Archetti, M. Grazia Speranza:
Exact solution methods for the multi-period vehicle routing problem with due dates. Comput. Oper. Res. 110: 148-158 (2019) - [j118]Maryam Darvish, Claudia Archetti, Leandro C. Coelho, M. Grazia Speranza:
Flexible two-echelon location routing problem. Eur. J. Oper. Res. 277(3): 1124-1136 (2019) - 2018
- [j117]Claudia Archetti, Dominique Feillet, Andrea Mor, M. Grazia Speranza:
An iterated local search for the Traveling Salesman Problem with release dates and completion time minimization. Comput. Oper. Res. 98: 24-37 (2018) - [j116]Enrico Angelelli, Valentina Morandi, Maria Grazia Speranza:
Congestion avoiding heuristic path generation for the proactive route guidance. Comput. Oper. Res. 99: 234-248 (2018) - [j115]M. Grazia Speranza:
Trends in transportation and logistics. Eur. J. Oper. Res. 264(3): 830-836 (2018) - [j114]Elena Fernández, Mireia Roca-Riu, M. Grazia Speranza:
The Shared Customer Collaboration Vehicle Routing Problem. Eur. J. Oper. Res. 265(3): 1078-1093 (2018) - [j113]Claudia Archetti, Marielle Christiansen, M. Grazia Speranza:
Inventory routing with pickups and deliveries. Eur. J. Oper. Res. 268(1): 314-324 (2018) - [j112]Nabil Absi, Claudia Archetti, Stéphane Dauzère-Pérès, Dominique Feillet, M. Grazia Speranza:
Comparing sequential and integrated approaches for the production routing problem. Eur. J. Oper. Res. 269(2): 633-646 (2018) - [j111]Nicola Bianchessi, Renata Mansini, M. Grazia Speranza:
A branch-and-cut algorithm for the Team Orienteering Problem. Int. Trans. Oper. Res. 25(2): 627-635 (2018) - [j110]Claudia Archetti, M. Grazia Speranza, Dennis Weyland:
A simulation study of an on-demand transportation system. Int. Trans. Oper. Res. 25(4): 1137-1161 (2018) - 2017
- [j109]Claudia Archetti, Guy Desaulniers, M. Grazia Speranza:
Minimizing the logistic ratio in the inventory routing problem. EURO J. Transp. Logist. 6(4): 289-306 (2017) - [j108]Jean-François Côté, Gianfranco Guastaroba, Maria Grazia Speranza:
The value of integrating loading and routing. Eur. J. Oper. Res. 257(1): 89-105 (2017) - [j107]Gianfranco Guastaroba, Martin W. P. Savelsbergh, Maria Grazia Speranza:
Adaptive Kernel Search: A heuristic for solving Mixed Integer linear Programs. Eur. J. Oper. Res. 263(3): 789-804 (2017) - [j106]Claudia Archetti, Natashia Boland, M. Grazia Speranza:
A Matheuristic for the Multivehicle Inventory Routing Problem. INFORMS J. Comput. 29(3): 377-387 (2017) - 2016
- [j105]Claudia Archetti, Ángel Corberán, Isaac Plana, José M. Sanchis, M. Grazia Speranza:
A branch-and-cut algorithm for the Orienteering Arc Routing Problem. Comput. Oper. Res. 66: 95-104 (2016) - [j104]Elena Fernández, Dario Fontana, M. Grazia Speranza:
On the Collaboration Uncapacitated Arc Routing Problem. Comput. Oper. Res. 67: 120-131 (2016) - [j103]Gianfranco Guastaroba, Renata Mansini, Wlodzimierz Ogryczak, Maria Grazia Speranza:
Linear programming models based on Omega ratio for the Enhanced Index Tracking Problem. Eur. J. Oper. Res. 251(3): 938-956 (2016) - [j102]Claudia Archetti, Martin W. P. Savelsbergh, M. Grazia Speranza:
The Vehicle Routing Problem with Occasional Drivers. Eur. J. Oper. Res. 254(2): 472-480 (2016) - [j101]Claudia Archetti, M. Grazia Speranza:
The inventory routing problem: the value of integration. Int. Trans. Oper. Res. 23(3): 393-407 (2016) - [j100]Claudia Archetti, Ann Melissa Campbell, M. Grazia Speranza:
Multicommodity vs. Single-Commodity Routing. Transp. Sci. 50(2): 461-472 (2016) - [j99]Gianfranco Guastaroba, Maria Grazia Speranza, Daniele Vigo:
Intermediate Facilities in Freight Transportation Planning: A Survey. Transp. Sci. 50(3): 763-789 (2016) - 2015
- [j98]R. Cuda, Gianfranco Guastaroba, Maria Grazia Speranza:
A survey on two-echelon routing problems. Comput. Oper. Res. 55: 185-199 (2015) - [j97]Claudia Archetti, Ola Jabali, M. Grazia Speranza:
Multi-period Vehicle Routing Problem with Due dates. Comput. Oper. Res. 61: 122-134 (2015) - [j96]Claudia Archetti, Nicola Bianchessi, M. Grazia Speranza:
A branch-price-and-cut algorithm for the commodity constrained split delivery vehicle routing problem. Comput. Oper. Res. 64: 1-10 (2015) - [j95]Claudia Archetti, Angel Corberán, Isaac Plana, José María Sanchis, M. Grazia Speranza:
A matheuristic for the Team Orienteering Arc Routing Problem. Eur. J. Oper. Res. 245(2): 392-401 (2015) - [j94]Tino Henke, M. Grazia Speranza, Gerhard Wäscher:
The multi-compartment vehicle routing problem with flexible compartment sizes. Eur. J. Oper. Res. 246(3): 730-743 (2015) - [j93]Claudia Archetti, Dominique Feillet, M. Grazia Speranza:
Complexity of routing problems with release dates. Eur. J. Oper. Res. 247(3): 797-803 (2015) - [j92]Gábor Nagy, Niaz A. Wassan, Maria Grazia Speranza, Claudia Archetti:
The Vehicle Routing Problem with Divisible Deliveries and Pickups. Transp. Sci. 49(2): 271-294 (2015) - 2014
- [j91]Claudia Archetti, Gianfranco Guastaroba, Maria Grazia Speranza:
An ILP-refined tabu search for the Directed Profitable Rural Postman Problem. Discret. Appl. Math. 163: 3-16 (2014) - [j90]Claudia Archetti, David Pisinger, M. Grazia Speranza:
Special issue on: "matheuristics". EURO J. Comput. Optim. 2(4): 221-222 (2014) - [j89]Claudia Archetti, M. Grazia Speranza:
A survey on matheuristics for routing problems. EURO J. Comput. Optim. 2(4): 223-246 (2014) - [j88]Renata Mansini, Wlodzimierz Ogryczak, Maria Grazia Speranza:
Twenty years of linear programming based portfolio optimization. Eur. J. Oper. Res. 234(2): 518-535 (2014) - [j87]Nicola Bianchessi, Renata Mansini, Maria Grazia Speranza:
The distance constrained multiple vehicle traveling purchaser problem. Eur. J. Oper. Res. 235(1): 73-87 (2014) - [j86]Claudio Arbib, Mara Servilio, Claudia Archetti, Maria Grazia Speranza:
The directed profitable location Rural Postman Problem. Eur. J. Oper. Res. 236(3): 811-819 (2014) - [j85]Claudia Archetti, Luca Bertazzi, Maria Grazia Speranza:
Polynomial cases of the economic lot sizing problem with cost discounts. Eur. J. Oper. Res. 237(2): 519-527 (2014) - [j84]Gianfranco Guastaroba, Maria Grazia Speranza:
A heuristic for BILP problems: The Single Source Capacitated Facility Location Problem. Eur. J. Oper. Res. 238(2): 438-450 (2014) - [j83]Claudia Archetti, Nicola Bianchessi, Maria Grazia Speranza:
Branch-and-cut algorithms for the split delivery vehicle routing problem. Eur. J. Oper. Res. 238(3): 685-698 (2014) - [j82]F. Piu, M. Grazia Speranza:
The locomotive assignment problem: a survey on optimization models. Int. Trans. Oper. Res. 21(3): 327-352 (2014) - [j81]Claudia Archetti, Nicola Bianchessi, Stefan Irnich, M. Grazia Speranza:
Formulations for an inventory routing problem. Int. Trans. Oper. Res. 21(3): 353-374 (2014) - [j80]Claudia Archetti, Nicola Bianchessi, Maria Grazia Speranza, Alain Hertz:
The split delivery capacitated team orienteering problem. Networks 63(1): 16-33 (2014) - [j79]Claudia Archetti, Nicola Bianchessi, Maria Grazia Speranza, Alain Hertz:
Incomplete service and split deliveries in a routing problem with profits. Networks 63(2): 135-145 (2014) - [j78]Enrico Angelelli, Cristina Bazgan, Maria Grazia Speranza, Zsolt Tuza:
Complexity and approximation for Traveling Salesman Problems with profits. Theor. Comput. Sci. 531: 54-65 (2014) - [j77]Claudia Archetti, Maria Grazia Speranza, Angel Corberán, José M. Sanchis, Isaac Plana:
The Team Orienteering Arc Routing Problem. Transp. Sci. 48(3): 442-457 (2014) - 2013
- [j76]Claudia Archetti, Gianfranco Guastaroba, Maria Grazia Speranza:
Reoptimizing the rural postman problem. Comput. Oper. Res. 40(5): 1306-1313 (2013) - [j75]Claudia Archetti, Nicola Bianchessi, Maria Grazia Speranza:
Optimal solutions for routing problems with profits. Discret. Appl. Math. 161(4-5): 547-557 (2013) - [j74]Martine Labbé, M. Grazia Speranza:
Editorial. EURO J. Comput. Optim. 1(1-2): 1-2 (2013) - [j73]Luca Bertazzi, M. Grazia Speranza:
Inventory routing problems with multiple customers. EURO J. Transp. Logist. 2(3): 255-275 (2013) - [j72]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) - [j71]Claudia Archetti, Nicola Bianchessi, Maria Grazia Speranza:
The capacitated team orienteering problem with incomplete service. Optim. Lett. 7(7): 1405-1417 (2013) - 2012
- [j70]Enrico Angelelli, Renata Mansini, Maria Grazia Speranza:
Kernel Search: a new heuristic framework for portfolio selection. Comput. Optim. Appl. 51(1): 345-361 (2012) - [j69]Michel Bierlaire, M. Grazia Speranza:
Editorial. EURO J. Transp. Logist. 1(1-2): 1-2 (2012) - [j68]Luca Bertazzi, M. Grazia Speranza:
Inventory routing problems: an introduction. EURO J. Transp. Logist. 1(4): 307-326 (2012) - [j67]Gianfranco Guastaroba, Maria Grazia Speranza:
Kernel Search: An application to the index tracking problem. Eur. J. Oper. Res. 217(1): 54-68 (2012) - [j66]Gianfranco Guastaroba, Maria Grazia Speranza:
Kernel search for the capacitated facility location problem. J. Heuristics 18(6): 877-917 (2012) - [j65]Claudia Archetti, Luca Bertazzi, Alain Hertz, Maria Grazia Speranza:
A Hybrid Heuristic for an Inventory Routing Problem. INFORMS J. Comput. 24(1): 101-116 (2012) - [j64]Renata Mansini, Maria Grazia Speranza:
CORAL: An Exact Algorithm for the Multidimensional Knapsack Problem. INFORMS J. Comput. 24(3): 399-415 (2012) - [j63]Claudia Archetti, Maria Grazia Speranza:
Vehicle routing problems with split deliveries. Int. Trans. Oper. Res. 19(1-2): 3-22 (2012) - [j62]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
- [j61]Claudia Archetti, Luca Bertazzi, Giuseppe Paletta, Maria Grazia Speranza:
Analysis of the maximum level policy in a production-distribution system. Comput. Oper. Res. 38(12): 1731-1746 (2011) - [j60]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) - [j59]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
- [j58]Claudia Archetti, Dominique Feillet, Alain Hertz, Maria Grazia Speranza:
The undirected capacitated arc routing problem with profits. Comput. Oper. Res. 37(11): 1860-1869 (2010) - [j57]Enrico Angelelli, Renata Mansini, Maria Grazia Speranza:
Kernel search: A general heuristic for the multi-dimensional knapsack problem. Comput. Oper. Res. 37(11): 2017-2026 (2010) - [j56]Claudia Archetti, Luca Bertazzi, Maria Grazia Speranza:
Reoptimizing the 0-1 knapsack problem. Discret. Appl. Math. 158(17): 1879-1887 (2010) - [j55]Enrico Angelelli, Nicola Bianchessi, Renata Mansini, Maria Grazia Speranza:
Comparison of policies in dynamic routing problems. J. Oper. Res. Soc. 61(4): 686-695 (2010) - [j54]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) - [j53]Enrico Angelelli, Maria Grazia Speranza, József Szoldatics, Zsolt Tuza:
Geometric representation for semi on-line scheduling on uniform processors. Optim. Methods Softw. 25(3): 421-428 (2010) - 2009
- [j52]Gianfranco Guastaroba, Renata Mansini, Maria Grazia Speranza:
On the effectiveness of scenario generation techniques in single-period portfolio optimization. Eur. J. Oper. Res. 192(2): 500-511 (2009) - [j51]Claudia Archetti, Dominique Feillet, Alain Hertz, Maria Grazia Speranza:
The capacitated team orienteering and profitable tour problems. J. Oper. Res. Soc. 60(6): 831-842 (2009) - 2008
- [j50]Enrico Angelelli, Maria Grazia Speranza, Zsolt Tuza:
Semi-online scheduling on two uniform processors. Theor. Comput. Sci. 393(1-3): 211-219 (2008) - [j49]Claudia Archetti, Maria Grazia Speranza, Martin W. P. Savelsbergh:
An Optimization-Based Heuristic for the Split Delivery Vehicle Routing Problem. Transp. Sci. 42(1): 22-31 (2008) - 2007
- [j48]Renata Mansini, Wlodzimierz Ogryczak, Maria Grazia Speranza:
Conditional value at risk and related linear programming models for portfolio optimization. Ann. Oper. Res. 152(1): 227-256 (2007) - [j47]Paolo Dell'Olmo, Raffaele Pesenti, Maria Grazia Speranza:
Editorial. Comput. Oper. Res. 34(6): 1515 (2007) - [j46]Claudia Archetti, Alain Hertz, Maria Grazia Speranza:
Metaheuristics for the team orienteering problem. J. Heuristics 13(1): 49-76 (2007) - [j45]Enrico Angelelli, Maria Grazia Speranza, Martin W. P. Savelsbergh:
Competitive analysis for dynamic multiperiod uncapacitated routing problems. Networks 49(4): 308-317 (2007) - [j44]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) - [j43]Claudia Archetti, Luca Bertazzi, Gilbert Laporte, Maria Grazia Speranza:
A Branch-and-Cut Algorithm for a Vendor-Managed Inventory-Routing Problem. Transp. Sci. 41(3): 382-391 (2007) - 2006
- [j42]Martine Labbé, José Pinto Paixão, Maria Grazia Speranza:
Preface. Ann. Oper. Res. 144(1): 1 (2006) - [j41]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. Discret. Math. Theor. Comput. Sci. 8(1): 1-16 (2006) - [j40]Claudia Archetti, Maria Grazia Speranza, Alain Hertz:
A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem. Transp. Sci. 40(1): 64-73 (2006) - [j39]Claudia Archetti, Martin W. P. Savelsbergh, Maria Grazia Speranza:
Worst-Case Analysis for Split Delivery Vehicle Routing Problems. Transp. Sci. 40(2): 226-234 (2006) - 2005
- [j38]Luca Bertazzi, Maria Grazia Speranza:
Improved rounding procedures for the discrete version of the capacitated EOQ problem. Eur. J. Oper. Res. 166(1): 25-34 (2005) - [j37]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) - [j36]Claudia Archetti, Renata Mansini, Maria Grazia Speranza:
Complexity and Reducibility of the Skip Delivery Problem. Transp. Sci. 39(2): 182-187 (2005) - 2004
- [j35]Luca Bertazzi, Giuseppe Paletta, Maria Grazia Speranza:
An improved heuristic for the period traveling salesman problem. Comput. Oper. Res. 31(8): 1215-1222 (2004) - [j34]Renata Mansini, Maria Grazia Speranza, Zsolt Tuza:
Scheduling groups of tasks with precedence constraints on three dedicated processors. Discret. Appl. Math. 134(1-3): 141-168 (2004) - [j33]Claudia Archetti, M. Grazia Speranza:
Vehicle routing in the 1-skip collection problem. J. Oper. Res. Soc. 55(7): 717-727 (2004) - [j32]Enrico Angelelli, Á. B. Nagy, Maria Grazia Speranza, Zsolt Tuza:
The On-Line Multiprocessor Scheduling Problem with Known Sum of the Tasks. J. Sched. 7(6): 421-428 (2004) - 2003
- [j31]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) - [j30]Luca Chiodi, Renata Mansini, Maria Grazia Speranza:
Semi-Absolute Deviation Rule for Mutual Funds Portfolio Selection. Ann. Oper. Res. 124(1-4): 245-265 (2003) - [j29]Renata Mansini, Wlodzimierz Ogryczak, Maria Grazia Speranza:
On LP Solvable Models for Portfolio Selection. Informatica 14(1): 37-62 (2003) - [j28]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) - [j27]Claudia Archetti, Luca Bertazzi, Maria Grazia Speranza:
Reoptimizing the traveling salesman problem. Networks 42(3): 154-159 (2003) - 2002
- [j26]Enrico Angelelli, Maria Grazia Speranza:
The periodic vehicle routing problem with intermediate facilities. Eur. J. Oper. Res. 137(2): 233-247 (2002) - [j25]Renata Mansini, M. Grazia Speranza:
A multidimensional knapsack model for asset-backed securitization. J. Oper. Res. Soc. 53(8): 822-832 (2002) - [j24]Enrico Angelelli, M. Grazia Speranza:
The application of a vehicle routing model to a waste-collection problem: two case studies. J. Oper. Res. Soc. 53(9): 944-952 (2002) - [j23]Luca Bertazzi, Giuseppe Paletta, Maria Grazia Speranza:
Deterministic Order-Up-To Level Policies in an Inventory Routing Problem. Transp. Sci. 36(1): 119-132 (2002) - [j22]Luca Bertazzi, Maria Grazia Speranza:
Continuous and Discrete Shipping Strategies for the Single Link Problem. Transp. Sci. 36(3): 314-325 (2002) - 2001
- [j21]Luca Bertazzi, Maria Grazia Speranza:
Rounding Procedures for the Discrete Version of the Capacitated Economic Order Quantity Problem. Ann. Oper. Res. 107(1-4): 33-49 (2001) - 2000
- [j20]Hans Kellerer, Renata Mansini, Maria Grazia Speranza:
Selecting Portfolios with Fixed Costs and Minimum Transaction Lots. Ann. Oper. Res. 99(1-4): 287-304 (2000) - [j19]Hans Kellerer, Renata Mansini, Maria Grazia Speranza:
Two linear approximation algorithms for the subset-sum problem. Eur. J. Oper. Res. 120(2): 289-296 (2000) - 1999
- [j18]Maria Grazia Speranza, Zsolt Tuza:
On-line approximation algorithms for scheduling tasks on identical machines withextendable working time. Ann. Oper. Res. 86: 491-506 (1999) - [j17]Paolo Dell'Olmo, Maria Grazia Speranza:
Approximation Algorithms for Partitioning Small Items in Unequal Bins to Minimize the Total Size. Discret. Appl. Math. 94(1-3): 181-191 (1999) - [j16]Renata Mansini, Maria Grazia Speranza:
Heuristic algorithms for the portfolio selection problem with minimum transaction lots. Eur. J. Oper. Res. 114(2): 219-233 (1999) - 1998
- [j15]Renata Mansini, Maria Grazia Speranza:
A linear programming model for the separate refuse collection service. Comput. Oper. Res. 25(7-8): 659-673 (1998) - [j14]Lucio Bianco, Paolo Dell'Olmo, Maria Grazia Speranza:
Heuristics for multimode scheduling problems with dedicated resources. Eur. J. Oper. Res. 107(2): 260-271 (1998) - [j13]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
- [j12]Rolf H. Möhring, Franz Josef Radermacher, Maria Grazia Speranza:
Scheduling at Villa Vigoni. Discret. Appl. Math. 72(1-2): 1-3 (1997) - [j11]Paolo Dell'Olmo, Maria Grazia Speranza, Zsolt Tuza:
Comparability Graph Augmentation for some Multiprocessor Scheduling Problems. Discret. Appl. Math. 72(1-2): 71-84 (1997) - [j10]Paolo Dell'Olmo, Maria Grazia Speranza, Zsolt Tuza:
Efficiency and effectiveness of normal schedules on three dedicated processors. Discret. Math. 164(1-3): 67-79 (1997) - [j9]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) - [j8]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
- [j7]Maria Grazia Speranza:
A heuristic algorithm for a portfolio optimization model applied to the Milan stock market. Comput. Oper. Res. 23(5): 433-441 (1996) - 1995
- [j6]Lucio Bianco, Paolo Dell'Olmo, Maria Grazia Speranza:
Scheduling Independent Tasks with Multiple Modes. Discret. Appl. Math. 62(1-3): 35-50 (1995) - 1994
- [j5]Maria Grazia Speranza, Walter Ukovich:
Minimizing Transportation and Inventory Costs for Several Products on a Single Link. Oper. Res. 42(5): 879-894 (1994) - [j4]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
- [j3]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) - 1984
- [j2]F. Scarioni, M. Grazia Speranza:
The density function of the number of moves to complete the Towers of Hanoi puzzle. Ann. Oper. Res. 1(3): 291-303 (1984) - [j1]Francesco Maffioli, M. Grazia Speranza, Carlo Vercellis:
Randomized algorithms: An annotated bibliography - In alphabetical order. Ann. Oper. Res. 1(3): 331-345 (1984)
Conference and Workshop Papers
- 2022
- [c5]Maria Grazia Speranza:
Trends in Transportation and Logistics and the Role of Optimization. IN4PL 2022: 7 - 2021
- [c4]Claudia Archetti, Ola Jabali, Andrea Mor, Alberto Simonetto, M. Grazia Speranza:
The Bi-Objective Long-Haul Transportation Problem on a Road Network (Invited Talk). CP 2021: 1:1-1:1 - 2014
- [c3]Claudia Archetti, Maria Grazia Speranza:
The Value Of Integration In Logistics. ECMS 2014: 691-697 - 2006
- [c2]Claudia Archetti, Maria Grazia Speranza:
An Overview on the Split Delivery Vehicle Routing Problem. OR 2006: 123-127 - 1997
- [c1]Hans Kellerer, Ulrich Pferschy, Maria Grazia Speranza:
An Efficient Approximation Scheme for the Subset-Sum Problem. ISAAC 1997: 394-403
Parts in Books or Collections
- 2014
- [p1]Claudia Archetti, M. Grazia Speranza, Daniele Vigo:
Vehicle Routing Problems with Profits. Vehicle Routing 2014: 273-297
Coauthor Index
[j143] [j141] [j136] [j134] [j130] [j126] [j125] [j119] [j118] [j117] [j113] [j112] [j110] [j109] [j106] [j105] [j102] [j101] [j100] [j97] [j96] [j95] [j93] [j92] [j91] [j90] [j89] [j86] [j85] [j83] [j81] [j80] [j79] [j77] [j76] [j75] [j71] [j65] [j63] [j62] [j61] [j59] [j58] [j56] [j54] [j51] [j49] [j46] [j43] [j40] [j39] [j36] [j33] [j27] [c4] [c3] [c2] [p1]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-30 20:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
