Maria Grazia Speranza

ORCID

Publication Activity (10 Years)

Years Active: 1992-2024
Publications (10 Years): 20

Top Venues

Eur. J. Oper. Res.

Comput. Oper. Res.

Transp. Sci.

Int. Trans. Oper. Res.

Publications

Enrico Angelelli, Andrea Mor, Maria Grazia Speranza
The one-station bike repositioning problem. Discret. Appl. Math. 357 (2024)
Enrico Angelelli, Valentina Morandi, Maria Grazia Speranza
Multi-day fair collaboration in demand-responsive transportation. Central Eur. J. Oper. Res. 32 (2) (2024)
Luce Brotcorne, Mario Guajardo, Celso C. Ribeiro, Maria Grazia Speranza
Tutorials and Reviews in Operations Research. Int. Trans. Oper. Res. 30 (6) (2023)
Andrea Mor, Maria Grazia Speranza
Vehicle routing problems over time: a survey. Ann. Oper. Res. 314 (1) (2022)
Maria Grazia Speranza
Trends in Transportation and Logistics and the Role of Optimization. IN4PL (2022)
Enrico Angelelli, M. Chiari, Andrea Mor, Maria Grazia Speranza
A simulation framework for a station-based bike-sharing system. Comput. Ind. Eng. 171 (2022)
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) (2021)
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 (2021)
Andrea Mor, Maria Grazia Speranza
Vehicle routing problems over time: a survey. 4OR 18 (2) (2020)
Carlo Filippi, Gianfranco Guastaroba, Maria Grazia Speranza
Conditional value-at-risk beyond finance: a survey. Int. Trans. Oper. Res. 27 (3) (2020)
Enrico Angelelli, Valentina Morandi, Maria Grazia Speranza
Minimizing the total travel time with limited unfairness in traffic networks. Comput. Oper. Res. 123 (2020)
Claudia Archetti, Dominique Feillet, Andrea Mor, Maria Grazia Speranza
Dynamic traveling salesman problem with stochastic release dates. Eur. J. Oper. Res. 280 (3) (2020)
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 (2019)
Enrico Angelelli, Valentina Morandi, Maria Grazia Speranza
Congestion avoiding heuristic path generation for the proactive route guidance. Comput. Oper. Res. 99 (2018)
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) (2017)
Jean-François Côté, Gianfranco Guastaroba, Maria Grazia Speranza
The value of integrating loading and routing. Eur. J. Oper. Res. 257 (1) (2017)
Gianfranco Guastaroba, Maria Grazia Speranza, Daniele Vigo
Intermediate Facilities in Freight Transportation Planning: A Survey. Transp. Sci. 50 (3) (2016)
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) (2016)
Gábor Nagy, Niaz A. Wassan, Maria Grazia Speranza, Claudia Archetti
The Vehicle Routing Problem with Divisible Deliveries and Pickups. Transp. Sci. 49 (2) (2015)
R. Cuda, Gianfranco Guastaroba, Maria Grazia Speranza
A survey on two-echelon routing problems. Comput. Oper. Res. 55 (2015)
Claudia Archetti, Nicola Bianchessi, Maria Grazia Speranza, Alain Hertz
The split delivery capacitated team orienteering problem. Networks 63 (1) (2014)
Nicola Bianchessi, Renata Mansini, Maria Grazia Speranza
The distance constrained multiple vehicle traveling purchaser problem. Eur. J. Oper. Res. 235 (1) (2014)
Claudia Archetti, Maria Grazia Speranza
The Value Of Integration In Logistics. ECMS (2014)
Claudia Archetti, Nicola Bianchessi, Maria Grazia Speranza
Branch-and-cut algorithms for the split delivery vehicle routing problem. Eur. J. Oper. Res. 238 (3) (2014)
Claudio Arbib, Mara Servilio, Claudia Archetti, Maria Grazia Speranza
The directed profitable location Rural Postman Problem. Eur. J. Oper. Res. 236 (3) (2014)
Claudia Archetti, Maria Grazia Speranza, Angel Corberán, José M. Sanchis, Isaac Plana
The Team Orienteering Arc Routing Problem. Transp. Sci. 48 (3) (2014)
Gianfranco Guastaroba, Maria Grazia Speranza
A heuristic for BILP problems: The Single Source Capacitated Facility Location Problem. Eur. J. Oper. Res. 238 (2) (2014)
Enrico Angelelli, Cristina Bazgan, Maria Grazia Speranza, Zsolt Tuza
Complexity and approximation for Traveling Salesman Problems with profits. Theor. Comput. Sci. 531 (2014)
Claudia Archetti, Gianfranco Guastaroba, Maria Grazia Speranza
An ILP-refined tabu search for the Directed Profitable Rural Postman Problem. Discret. Appl. Math. 163 (2014)
Renata Mansini, Wlodzimierz Ogryczak, Maria Grazia Speranza
Twenty years of linear programming based portfolio optimization. Eur. J. Oper. Res. 234 (2) (2014)
Claudia Archetti, Nicola Bianchessi, Maria Grazia Speranza, Alain Hertz
Incomplete service and split deliveries in a routing problem with profits. Networks 63 (2) (2014)
Claudia Archetti, Luca Bertazzi, Maria Grazia Speranza
Polynomial cases of the economic lot sizing problem with cost discounts. Eur. J. Oper. Res. 237 (2) (2014)
Francesco Carrabs, Raffaele Cerulli, Maria Grazia Speranza
A branch-and-bound algorithm for the double travelling salesman problem with two stacks. Networks 61 (1) (2013)
Claudia Archetti, Nicola Bianchessi, Maria Grazia Speranza
Optimal solutions for routing problems with profits. Discret. Appl. Math. 161 (4-5) (2013)
Claudia Archetti, Nicola Bianchessi, Maria Grazia Speranza
The capacitated team orienteering problem with incomplete service. Optim. Lett. 7 (7) (2013)
Claudia Archetti, Gianfranco Guastaroba, Maria Grazia Speranza
Reoptimizing the rural postman problem. Comput. Oper. Res. 40 (5) (2013)
Gianfranco Guastaroba, Maria Grazia Speranza
Kernel search for the capacitated facility location problem. J. Heuristics 18 (6) (2012)
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) (2012)
Enrico Angelelli, Renata Mansini, Maria Grazia Speranza
Kernel Search: a new heuristic framework for portfolio selection. Comput. Optim. Appl. 51 (1) (2012)
Gianfranco Guastaroba, Maria Grazia Speranza
Kernel Search: An application to the index tracking problem. Eur. J. Oper. Res. 217 (1) (2012)
Claudia Archetti, Maria Grazia Speranza
Vehicle routing problems with split deliveries. Int. Trans. Oper. Res. 19 (1-2) (2012)
Claudia Archetti, Luca Bertazzi, Alain Hertz, Maria Grazia Speranza
A Hybrid Heuristic for an Inventory Routing Problem. INFORMS J. Comput. 24 (1) (2012)
Renata Mansini, Maria Grazia Speranza
CORAL: An Exact Algorithm for the Multidimensional Knapsack Problem. INFORMS J. Comput. 24 (3) (2012)
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) (2011)
Claudia Archetti, Nicola Bianchessi, Maria Grazia Speranza
A column generation approach for the split delivery vehicle routing problem. Networks 58 (4) (2011)
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) (2011)
Enrico Angelelli, Renata Mansini, Maria Grazia Speranza
Kernel search: A general heuristic for the multi-dimensional knapsack problem. Comput. Oper. Res. 37 (11) (2010)
Claudia Archetti, Dominique Feillet, Alain Hertz, Maria Grazia Speranza
The undirected capacitated arc routing problem with profits. Comput. Oper. Res. 37 (11) (2010)
Enrico Angelelli, Nicola Bianchessi, Renata Mansini, Maria Grazia Speranza
Comparison of policies in dynamic routing problems. J. Oper. Res. Soc. 61 (4) (2010)
Hanne L. Petersen, Claudia Archetti, Maria Grazia Speranza
Exact solutions to the double travelling salesman problem with multiple stacks. Networks 56 (4) (2010)
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) (2010)
Claudia Archetti, Luca Bertazzi, Maria Grazia Speranza
Reoptimizing the 0-1 knapsack problem. Discret. Appl. Math. 158 (17) (2010)
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) (2009)
Claudia Archetti, Dominique Feillet, Alain Hertz, Maria Grazia Speranza
The capacitated team orienteering and profitable tour problems. J. Oper. Res. Soc. 60 (6) (2009)
Claudia Archetti, Maria Grazia Speranza, Martin W. P. Savelsbergh
An Optimization-Based Heuristic for the Split Delivery Vehicle Routing Problem. Transp. Sci. 42 (1) (2008)
Enrico Angelelli, Maria Grazia Speranza, Zsolt Tuza
Semi-online scheduling on two uniform processors. Theor. Comput. Sci. 393 (1-3) (2008)
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) (2007)
Paolo Dell'Olmo, Raffaele Pesenti, Maria Grazia Speranza
Editorial. Comput. Oper. Res. 34 (6) (2007)
Claudia Archetti, Alain Hertz, Maria Grazia Speranza
Metaheuristics for the team orienteering problem. J. Heuristics 13 (1) (2007)
Renata Mansini, Wlodzimierz Ogryczak, Maria Grazia Speranza
Conditional value at risk and related linear programming models for portfolio optimization. Ann. Oper. Res. 152 (1) (2007)
Enrico Angelelli, Maria Grazia Speranza, Martin W. P. Savelsbergh
Competitive analysis for dynamic multiperiod uncapacitated routing problems. Networks 49 (4) (2007)
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) (2007)
Claudia Archetti, Martin W. P. Savelsbergh, Maria Grazia Speranza
Worst-Case Analysis for Split Delivery Vehicle Routing Problems. Transp. Sci. 40 (2) (2006)
Claudia Archetti, Maria Grazia Speranza
An Overview on the Split Delivery Vehicle Routing Problem. OR (2006)
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) (2006)
Martine Labbé, José Pinto Paixão, Maria Grazia Speranza
Preface. Ann. Oper. Res. 144 (1) (2006)
Claudia Archetti, Maria Grazia Speranza, Alain Hertz
A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem. Transp. Sci. 40 (1) (2006)
Luca Bertazzi, Maria Grazia Speranza
Improved rounding procedures for the discrete version of the capacitated EOQ problem. Eur. J. Oper. Res. 166 (1) (2005)
Claudia Archetti, Renata Mansini, Maria Grazia Speranza
Complexity and Reducibility of the Skip Delivery Problem. Transp. Sci. 39 (2) (2005)
Luca Bertazzi, Giuseppe Paletta, Maria Grazia Speranza
Minimizing the Total Cost in an Integrated Vendor - Managed Inventory System. J. Heuristics 11 (5-6) (2005)
Luca Bertazzi, Giuseppe Paletta, Maria Grazia Speranza
An improved heuristic for the period traveling salesman problem. Comput. Oper. Res. 31 (8) (2004)
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) (2004)
Renata Mansini, Maria Grazia Speranza, Zsolt Tuza
Scheduling groups of tasks with precedence constraints on three dedicated processors. Discret. Appl. Math. 134 (1-3) (2004)
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) (2003)
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) (2003)
Claudia Archetti, Luca Bertazzi, Maria Grazia Speranza
Reoptimizing the traveling salesman problem. Networks 42 (3) (2003)
Renata Mansini, Wlodzimierz Ogryczak, Maria Grazia Speranza
On LP Solvable Models for Portfolio Selection. Informatica 14 (1) (2003)
Luca Chiodi, Renata Mansini, Maria Grazia Speranza
Semi-Absolute Deviation Rule for Mutual Funds Portfolio Selection. Ann. Oper. Res. 124 (1-4) (2003)
Enrico Angelelli, Maria Grazia Speranza
The periodic vehicle routing problem with intermediate facilities. Eur. J. Oper. Res. 137 (2) (2002)
Luca Bertazzi, Giuseppe Paletta, Maria Grazia Speranza
Deterministic Order-Up-To Level Policies in an Inventory Routing Problem. Transp. Sci. 36 (1) (2002)
Luca Bertazzi, Maria Grazia Speranza
Continuous and Discrete Shipping Strategies for the Single Link Problem. Transp. Sci. 36 (3) (2002)
Luca Bertazzi, Maria Grazia Speranza
Rounding Procedures for the Discrete Version of the Capacitated Economic Order Quantity Problem. Ann. Oper. Res. 107 (1-4) (2001)
Hans Kellerer, Renata Mansini, Maria Grazia Speranza
Two linear approximation algorithms for the subset-sum problem. Eur. J. Oper. Res. 120 (2) (2000)
Hans Kellerer, Renata Mansini, Maria Grazia Speranza
Selecting Portfolios with Fixed Costs and Minimum Transaction Lots. Ann. Oper. Res. 99 (1-4) (2000)
Renata Mansini, Maria Grazia Speranza
Heuristic algorithms for the portfolio selection problem with minimum transaction lots. Eur. J. Oper. Res. 114 (2) (1999)
Maria Grazia Speranza, Zsolt Tuza
On-line approximation algorithms for scheduling tasks on identical machines withextendable working time. Ann. Oper. Res. 86 (1999)
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) (1999)
Lucio Bianco, Paolo Dell'Olmo, Maria Grazia Speranza
Heuristics for multimode scheduling problems with dedicated resources. Eur. J. Oper. Res. 107 (2) (1998)
Renata Mansini, Maria Grazia Speranza
A linear programming model for the separate refuse collection service. Comput. Oper. Res. 25 (7-8) (1998)
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) (1998)
Hans Kellerer, Vladimir Kotov, Maria Grazia Speranza, Zsolt Tuza
Semi on-line algorithms for the partition problem. Oper. Res. Lett. 21 (5) (1997)
Hans Kellerer, Ulrich Pferschy, Maria Grazia Speranza
An Efficient Approximation Scheme for the Subset-Sum Problem. ISAAC (1997)
Paolo Dell'Olmo, Maria Grazia Speranza, Zsolt Tuza
Efficiency and effectiveness of normal schedules on three dedicated processors. Discret. Math. 164 (1-3) (1997)
Paolo Dell'Olmo, Maria Grazia Speranza, Zsolt Tuza
Comparability Graph Augmentation for some Multiprocessor Scheduling Problems. Discret. Appl. Math. 72 (1-2) (1997)
Rolf H. Möhring, Franz Josef Radermacher, Maria Grazia Speranza
Scheduling at Villa Vigoni. Discret. Appl. Math. 72 (1-2) (1997)
Paolo Dell'Olmo, Stefano Giordani, Maria Grazia Speranza
An Approximation Result for a Duo-Processor Task Scheduling Problem. Inf. Process. Lett. 61 (4) (1997)
Maria Grazia Speranza
A heuristic algorithm for a portfolio optimization model applied to the Milan stock market. Comput. Oper. Res. 23 (5) (1996)
Lucio Bianco, Paolo Dell'Olmo, Maria Grazia Speranza
Scheduling Independent Tasks with Multiple Modes. Discret. Appl. Math. 62 (1-3) (1995)
Maria Grazia Speranza, Walter Ukovich
Minimizing Transportation and Inventory Costs for Several Products on a Single Link. Oper. Res. 42 (5) (1994)
Jacek Blazewicz, Paolo Dell'Olmo, Maciej Drozdowski, Maria Grazia Speranza
Corrigendum: Scheduling Multiprocessor Tasks on Three Dedicated Processors. Inf. Process. Lett. 49 (5) (1994)

Maria Grazia Speranza.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Maria Grazia Speranza