default search action
Maria 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
2020 – today
- 2024
- [j146]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) - [j145]Enrico Angelelli, Andrea Mor
The one-station bike repositioning problem. Discret. Appl. Math. 357: 173-196 (2024) - [j144]Wenjuan Gu
Vehicle routing problems with multiple commodities: A survey. Eur. J. Oper. Res. 317(1): 1-15 (2024) - [j143]Laura A. Albert, Annunziata Esposito Amideo, Julia A. Bennell, Sally C. Brailsford
Commentary on Carroll & Esposito Amideo "Gender Equality: Opportunities and challenges for the OR community". J. Oper. Res. Soc. 75(6): 1030-1042 (2024) - 2023
- [j142]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) - [j141]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) - [j140]Carlo Filippi, Gianfranco Guastaroba, Lorenzo Peirano
Trends in passenger transport optimisation. Int. Trans. Oper. Res. 30(6): 3057-3086 (2023) - [j139]Juan Carlos Martínez Mori
On the Value of Dynamism in Transit Networks. Transp. Sci. 57(3): 578-593 (2023) - 2022
- [j138]Andrea Mor
Vehicle routing problems over time: a survey. Ann. Oper. Res. 314(1): 255-275 (2022) - [j137]Wenjuan Gu, Claudia Archetti
A sequential approach for a multi-commodity two-echelon distribution problem. Comput. Ind. Eng. 163: 107793 (2022) - [j136]Enrico Angelelli
A simulation framework for a station-based bike-sharing system. Comput. Ind. Eng. 171: 108489 (2022) - [j135]Claudia Archetti
Optimization in multimodal freight transportation problems: A Survey. Eur. J. Oper. Res. 299(1): 1-20 (2022) - [c5]Maria Grazia Speranza:
Trends in Transportation and Logistics and the Role of Optimization. IN4PL 2022: 7 - 2021
- [j134]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) - [j133]Carlo Filippi
On single-source capacitated facility location with cost and fairness objectives. Eur. J. Oper. Res. 289(3): 959-974 (2021) - [j132]Enrico Angelelli
System optimal routing of traffic flows with user constraints using linear programming. Eur. J. Oper. Res. 293(3): 863-879 (2021) - [j131]Claudia Archetti
A kernel search heuristic for the multivehicle inventory routing problem. Int. Trans. Oper. Res. 28(6): 2984-3013 (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 - 2020
- [j130]Andrea Mor
Vehicle routing problems over time: a survey. 4OR 18(2): 129-149 (2020) - [j129]Gianfranco Guastaroba
Enhanced index tracking with CVaR-based ratio measures. Ann. Oper. Res. 292(2): 883-931 (2020) - [j128]Enrico Angelelli
Minimizing the total travel time with limited unfairness in traffic networks. Comput. Oper. Res. 123: 105016 (2020) - [j127]Claudia Archetti
Dynamic traveling salesman problem with stochastic release dates. Eur. J. Oper. Res. 280(3): 832-844 (2020) - [j126]Claudia Archetti
A branch-and-cut algorithm for the inventory routing problem with pickups and deliveries. Eur. J. Oper. Res. 282(3): 886-895 (2020) - [j125]Carlo Filippi, Gianfranco Guastaroba, Maria Grazia Speranza:
Conditional value-at-risk beyond finance: a survey. Int. Trans. Oper. Res. 27(3): 1277-1319 (2020)
2010 – 2019
- 2019
- [j124]Tino Henke
A branch-and-cut algorithm for the multi-compartment vehicle routing problem with flexible compartment sizes. Ann. Oper. Res. 275(2): 321-338 (2019) - [j123]Carlo Filippi
Bridging k-sum and CVaR optimization in MILP. Comput. Oper. Res. 105: 156-166 (2019) - [j122]Lars Dahle
The pickup and delivery problem with time windows and occasional drivers. Comput. Oper. Res. 109: 122-133 (2019) - [j121]Enrico Angelelli
A trade-off between average and maximum arc congestion minimization in traffic assignment with user constraints. Comput. Oper. Res. 110: 88-100 (2019) - [j120]Homero Larrain
Exact solution methods for the multi-period vehicle routing problem with due dates. Comput. Oper. Res. 110: 148-158 (2019) - [j119]Maryam Darvish
Flexible two-echelon location routing problem. Eur. J. Oper. Res. 277(3): 1124-1136 (2019) - 2018
- [j118]Claudia Archetti
An iterated local search for the Traveling Salesman Problem with release dates and completion time minimization. Comput. Oper. Res. 98: 24-37 (2018) - [j117]Enrico Angelelli
Congestion avoiding heuristic path generation for the proactive route guidance. Comput. Oper. Res. 99: 234-248 (2018) - [j116]M. Grazia Speranza:
Trends in transportation and logistics. Eur. J. Oper. Res. 264(3): 830-836 (2018) - [j115]Elena Fernández
The Shared Customer Collaboration Vehicle Routing Problem. Eur. J. Oper. Res. 265(3): 1078-1093 (2018) - [j114]Claudia Archetti
Inventory routing with pickups and deliveries. Eur. J. Oper. Res. 268(1): 314-324 (2018) - [j113]Nabil Absi
Comparing sequential and integrated approaches for the production routing problem. Eur. J. Oper. Res. 269(2): 633-646 (2018) - [j112]Nicola Bianchessi
A branch-and-cut algorithm for the Team Orienteering Problem. Int. Trans. Oper. Res. 25(2): 627-635 (2018) - [j111]Claudia Archetti
A simulation study of an on-demand transportation system. Int. Trans. Oper. Res. 25(4): 1137-1161 (2018) - 2017
- [j110]Claudia Archetti
Minimizing the logistic ratio in the inventory routing problem. EURO J. Transp. Logist. 6(4): 289-306 (2017) - [j109]Jean-François Côté
The value of integrating loading and routing. Eur. J. Oper. Res. 257(1): 89-105 (2017) - [j108]Gianfranco Guastaroba
Adaptive Kernel Search: A heuristic for solving Mixed Integer linear Programs. Eur. J. Oper. Res. 263(3): 789-804 (2017) - [j107]Claudia Archetti
A Matheuristic for the Multivehicle Inventory Routing Problem. INFORMS J. Comput. 29(3): 377-387 (2017) - 2016
- [j106]Claudia Archetti
A branch-and-cut algorithm for the Orienteering Arc Routing Problem. Comput. Oper. Res. 66: 95-104 (2016) - [j105]Elena Fernández
On the Collaboration Uncapacitated Arc Routing Problem. Comput. Oper. Res. 67: 120-131 (2016) - [j104]Gianfranco Guastaroba
Linear programming models based on Omega ratio for the Enhanced Index Tracking Problem. Eur. J. Oper. Res. 251(3): 938-956 (2016) - [j103]Claudia Archetti
The Vehicle Routing Problem with Occasional Drivers. Eur. J. Oper. Res. 254(2): 472-480 (2016) - [j102]Claudia Archetti
The inventory routing problem: the value of integration. Int. Trans. Oper. Res. 23(3): 393-407 (2016) - [j101]Claudia Archetti
Multicommodity vs. Single-Commodity Routing. Transp. Sci. 50(2): 461-472 (2016) - [j100]Gianfranco Guastaroba
Intermediate Facilities in Freight Transportation Planning: A Survey. Transp. Sci. 50(3): 763-789 (2016) - 2015
- [j99]R. Cuda, Gianfranco Guastaroba
A survey on two-echelon routing problems. Comput. Oper. Res. 55: 185-199 (2015) - [j98]Claudia Archetti
Multi-period Vehicle Routing Problem with Due dates. Comput. Oper. Res. 61: 122-134 (2015) - [j97]Claudia Archetti
A branch-price-and-cut algorithm for the commodity constrained split delivery vehicle routing problem. Comput. Oper. Res. 64: 1-10 (2015) - [j96]Claudia Archetti
A matheuristic for the Team Orienteering Arc Routing Problem. Eur. J. Oper. Res. 245(2): 392-401 (2015) - [j95]Tino Henke, M. Grazia Speranza
The multi-compartment vehicle routing problem with flexible compartment sizes. Eur. J. Oper. Res. 246(3): 730-743 (2015) - [j94]Claudia Archetti
Complexity of routing problems with release dates. Eur. J. Oper. Res. 247(3): 797-803 (2015) - [j93]Gábor Nagy, Niaz A. Wassan, Maria Grazia Speranza
The Vehicle Routing Problem with Divisible Deliveries and Pickups. Transp. Sci. 49(2): 271-294 (2015) - 2014
- [j92]Claudia Archetti
An ILP-refined tabu search for the Directed Profitable Rural Postman Problem. Discret. Appl. Math. 163: 3-16 (2014) - [j91]Claudia Archetti
Special issue on: "matheuristics". EURO J. Comput. Optim. 2(4): 221-222 (2014) - [j90]Claudia Archetti
A survey on matheuristics for routing problems. EURO J. Comput. Optim. 2(4): 223-246 (2014) - [j89]Renata Mansini
Twenty years of linear programming based portfolio optimization. Eur. J. Oper. Res. 234(2): 518-535 (2014) - [j88]Nicola Bianchessi
The distance constrained multiple vehicle traveling purchaser problem. Eur. J. Oper. Res. 235(1): 73-87 (2014) - [j87]Claudio Arbib
The directed profitable location Rural Postman Problem. Eur. J. Oper. Res. 236(3): 811-819 (2014) - [j86]Claudia Archetti
Polynomial cases of the economic lot sizing problem with cost discounts. Eur. J. Oper. Res. 237(2): 519-527 (2014) - [j85]Gianfranco Guastaroba
A heuristic for BILP problems: The Single Source Capacitated Facility Location Problem. Eur. J. Oper. Res. 238(2): 438-450 (2014) - [j84]Claudia Archetti
Branch-and-cut algorithms for the split delivery vehicle routing problem. Eur. J. Oper. Res. 238(3): 685-698 (2014) - [j83]F. Piu, M. Grazia Speranza
The locomotive assignment problem: a survey on optimization models. Int. Trans. Oper. Res. 21(3): 327-352 (2014) - [j82]Claudia Archetti
Formulations for an inventory routing problem. Int. Trans. Oper. Res. 21(3): 353-374 (2014) - [j81]Claudia Archetti
The split delivery capacitated team orienteering problem. Networks 63(1): 16-33 (2014) - [j80]Claudia Archetti
Incomplete service and split deliveries in a routing problem with profits. Networks 63(2): 135-145 (2014) - [j79]Enrico Angelelli
Complexity and approximation for Traveling Salesman Problems with profits. Theor. Comput. Sci. 531: 54-65 (2014) - [j78]Claudia Archetti
The Team Orienteering Arc Routing Problem. Transp. Sci. 48(3): 442-457 (2014) - [c3]Claudia Archetti, Maria Grazia Speranza:
The Value Of Integration In Logistics. ECMS 2014: 691-697 - [p1]Claudia Archetti, M. Grazia Speranza, Daniele Vigo:
Vehicle Routing Problems with Profits. Vehicle Routing 2014: 273-297 - 2013
- [j77]Claudia Archetti
Reoptimizing the rural postman problem. Comput. Oper. Res. 40(5): 1306-1313 (2013) - [j76]Claudia Archetti
Optimal solutions for routing problems with profits. Discret. Appl. Math. 161(4-5): 547-557 (2013) - [j75]Martine Labbé, M. Grazia Speranza:
Editorial. EURO J. Comput. Optim. 1(1-2): 1-2 (2013) - [j74]Luca Bertazzi, M. Grazia Speranza:
Inventory routing problems with multiple customers. EURO J. Transp. Logist. 2(3): 255-275 (2013) - [j73]Francesco Carrabs
A branch-and-bound algorithm for the double travelling salesman problem with two stacks. Networks 61(1): 58-75 (2013) - [j72]Claudia Archetti
The capacitated team orienteering problem with incomplete service. Optim. Lett. 7(7): 1405-1417 (2013) - 2012
- [j71]Enrico Angelelli
Kernel Search: a new heuristic framework for portfolio selection. Comput. Optim. Appl. 51(1): 345-361 (2012) - [j70]Michel Bierlaire, M. Grazia Speranza:
Editorial. EURO J. Transp. Logist. 1(1-2): 1-2 (2012) - [j69]Luca Bertazzi, M. Grazia Speranza:
Inventory routing problems: an introduction. EURO J. Transp. Logist. 1(4): 307-326 (2012) - [j68]Gianfranco Guastaroba
Kernel Search: An application to the index tracking problem. Eur. J. Oper. Res. 217(1): 54-68 (2012) - [j67]Gianfranco Guastaroba
Kernel search for the capacitated facility location problem. J. Heuristics 18(6): 877-917 (2012) - [j66]Claudia Archetti
A Hybrid Heuristic for an Inventory Routing Problem. INFORMS J. Comput. 24(1): 101-116 (2012) - [j65]Renata Mansini
CORAL: An Exact Algorithm for the Multidimensional Knapsack Problem. INFORMS J. Comput. 24(3): 399-415 (2012) - [j64]Claudia Archetti
Vehicle routing problems with split deliveries. Int. Trans. Oper. Res. 19(1-2): 3-22 (2012) - [j63]Jean-François Côté
A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks. Networks 60(4): 212-226 (2012) - 2011
- [j62]Claudia Archetti
Analysis of the maximum level policy in a production-distribution system. Comput. Oper. Res. 38(12): 1731-1746 (2011) - [j61]György Dósa, Maria Grazia Speranza
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) - [j60]Claudia Archetti
A column generation approach for the split delivery vehicle routing problem. Networks 58(4): 241-254 (2011) - 2010
- [j59]Claudia Archetti
The undirected capacitated arc routing problem with profits. Comput. Oper. Res. 37(11): 1860-1869 (2010) - [j58]Enrico Angelelli
Kernel search: A general heuristic for the multi-dimensional knapsack problem. Comput. Oper. Res. 37(11): 2017-2026 (2010) - [j57]Claudia Archetti
Reoptimizing the 0-1 knapsack problem. Discret. Appl. Math. 158(17): 1879-1887 (2010) - [j56]Enrico Angelelli
Comparison of policies in dynamic routing problems. J. Oper. Res. Soc. 61(4): 686-695 (2010) - [j55]Hanne L. Petersen, Claudia Archetti
Exact solutions to the double travelling salesman problem with multiple stacks. Networks 56(4): 229-243 (2010) - [j54]Enrico Angelelli
Geometric representation for semi on-line scheduling on uniform processors. Optim. Methods Softw. 25(3): 421-428 (2010)
2000 – 2009
- 2009
- [j53]Gianfranco Guastaroba
On the effectiveness of scenario generation techniques in single-period portfolio optimization. Eur. J. Oper. Res. 192(2): 500-511 (2009) - [j52]Claudia Archetti
The capacitated team orienteering and profitable tour problems. J. Oper. Res. Soc. 60(6): 831-842 (2009) - 2008
- [j51]Enrico Angelelli
Semi-online scheduling on two uniform processors. Theor. Comput. Sci. 393(1-3): 211-219 (2008) - [j50]Claudia Archetti
An Optimization-Based Heuristic for the Split Delivery Vehicle Routing Problem. Transp. Sci. 42(1): 22-31 (2008) - 2007
- [j49]Renata Mansini
Conditional value at risk and related linear programming models for portfolio optimization. Ann. Oper. Res. 152(1): 227-256 (2007) - [j48]Paolo Dell'Olmo, Raffaele Pesenti
Editorial. Comput. Oper. Res. 34(6): 1515 (2007) - [j47]Claudia Archetti
Metaheuristics for the team orienteering problem. J. Heuristics 13(1): 49-76 (2007) - [j46]Enrico Angelelli
Competitive analysis for dynamic multiperiod uncapacitated routing problems. Networks 49(4): 308-317 (2007) - [j45]Enrico Angelelli
Competitive analysis of a dispatch policy for a dynamic multi-period routing problem. Oper. Res. Lett. 35(6): 713-721 (2007) - [j44]Enrico Angelelli
Semi on-line scheduling on three processors with known sum of the tasks. J. Sched. 10(4-5): 263-269 (2007) - [j43]Claudia Archetti
A Branch-and-Cut Algorithm for a Vendor-Managed Inventory-Routing Problem. Transp. Sci. 41(3): 382-391 (2007) - 2006
- [j42]Martine Labbé
Preface. Ann. Oper. Res. 144(1): 1 (2006) - [j41]Enrico Angelelli
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
A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem. Transp. Sci. 40(1): 64-73 (2006) - [j39]Claudia Archetti
Worst-Case Analysis for Split Delivery Vehicle Routing Problems. Transp. Sci. 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
- [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
Minimizing the Total Cost in an Integrated Vendor - Managed Inventory System. J. Heuristics 11(5-6): 393-419 (2005) - [j36]Claudia Archetti
Complexity and Reducibility of the Skip Delivery Problem. Transp. Sci. 39(2): 182-187 (2005) - 2004
- [j35]Luca Bertazzi, Giuseppe Paletta
An improved heuristic for the period traveling salesman problem. Comput. Oper. Res. 31(8): 1215-1222 (2004) - [j34]Renata Mansini
Scheduling groups of tasks with precedence constraints on three dedicated processors. Discret. Appl. Math. 134(1-3): 141-168 (2004) - [j33]Claudia Archetti
Vehicle routing in the 1-skip collection problem. J. Oper. Res. Soc. 55(7): 717-727 (2004) - [j32]Enrico Angelelli
The On-Line Multiprocessor Scheduling Problem with Known Sum of the Tasks. J. Sched. 7(6): 421-428 (2004) - 2003
- [j31]Enrico Angelelli
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
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
An efficient fully polynomial approximation scheme for the Subset-Sum Problem. J. Comput. Syst. Sci. 66(2): 349-370 (2003) - [j27]Claudia Archetti
Reoptimizing the traveling salesman problem. Networks 42(3): 154-159 (2003) - 2002
- [j26]Enrico Angelelli
The periodic vehicle routing problem with intermediate facilities. Eur. J. Oper. Res. 137(2): 233-247 (2002) - [j25]Renata Mansini
A multidimensional knapsack model for asset-backed securitization. J. Oper. Res. Soc. 53(8): 822-832 (2002) - [j24]Enrico Angelelli
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
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
Two linear approximation algorithms for the subset-sum problem. Eur. J. Oper. Res. 120(2): 289-296 (2000)
1990 – 1999
- 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
Heuristic algorithms for the portfolio selection problem with minimum transaction lots. Eur. J. Oper. Res. 114(2): 219-233 (1999) - 1998
- [j15]Renata Mansini
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) - [c1]Hans Kellerer, Ulrich Pferschy, Maria Grazia Speranza
An Efficient Approximation Scheme for the Subset-Sum Problem. ISAAC 1997: 394-403 - 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
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)
1980 – 1989
- 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
Randomized algorithms: An annotated bibliography - In alphabetical order. Ann. Oper. Res. 1(3): 331-345 (1984)
Coauthor Index
[j144] [j142] [j137] [j135] [j131] [c4] [j127] [j126] [j120] [j119] [j118] [j114] [j113] [j111] [j110] [j107] [j106] [j103] [j102] [j101] [j98] [j97] [j96] [j94] [j93] [j92] [j91] [j90] [j87] [j86] [j84] [j82] [j81] [j80] [j78] [c3] [p1] [j77] [j76] [j72] [j66] [j64] [j63] [j62] [j60] [j59] [j57] [j55] [j52] [j50] [j47] [j43] [j40] [j39] [c2] [j36] [j33] [j27]
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-12-26 00:49 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: