Maria Grazia Speranza

According to our database1, Maria Grazia Speranza authored at least 118 papers between 1984 and 2018.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2018
A branch-and-cut algorithm for the Team Orienteering Problem.
ITOR, 2018

A simulation study of an on-demand transportation system.
ITOR, 2018

Trends in transportation and logistics.
European Journal of Operational Research, 2018

The Shared Customer Collaboration Vehicle Routing Problem.
European Journal of Operational Research, 2018

Inventory routing with pickups and deliveries.
European Journal of Operational Research, 2018

Comparing sequential and integrated approaches for the production routing problem.
European Journal of Operational Research, 2018

An iterated local search for the Traveling Salesman Problem with release dates and completion time minimization.
Computers & OR, 2018

Congestion avoiding heuristic path generation for the proactive route guidance.
Computers & OR, 2018

2017
A Matheuristic for the Multivehicle Inventory Routing Problem.
INFORMS Journal on Computing, 2017

Adaptive Kernel Search: A heuristic for solving Mixed Integer linear Programs.
European Journal of Operational Research, 2017

The value of integrating loading and routing.
European Journal of Operational Research, 2017

Minimizing the logistic ratio in the inventory routing problem.
EURO J. Transportation and Logistics, 2017

2016
Intermediate Facilities in Freight Transportation Planning: A Survey.
Transportation Science, 2016

Multicommodity vs. Single-Commodity Routing.
Transportation Science, 2016

The inventory routing problem: the value of integration.
ITOR, 2016

Linear programming models based on Omega ratio for the Enhanced Index Tracking Problem.
European Journal of Operational Research, 2016

The Vehicle Routing Problem with Occasional Drivers.
European Journal of Operational Research, 2016

On the Collaboration Uncapacitated Arc Routing Problem.
Computers & OR, 2016

A branch-and-cut algorithm for the Orienteering Arc Routing Problem.
Computers & OR, 2016

2015
The Vehicle Routing Problem with Divisible Deliveries and Pickups.
Transportation Science, 2015

The multi-compartment vehicle routing problem with flexible compartment sizes.
European Journal of Operational Research, 2015

Complexity of routing problems with release dates.
European Journal of Operational Research, 2015

A matheuristic for the Team Orienteering Arc Routing Problem.
European Journal of Operational Research, 2015

A survey on two-echelon routing problems.
Computers & OR, 2015

Multi-period Vehicle Routing Problem with Due dates.
Computers & OR, 2015

A branch-price-and-cut algorithm for the commodity constrained split delivery vehicle routing problem.
Computers & OR, 2015

2014
The Team Orienteering Arc Routing Problem.
Transportation Science, 2014

Complexity and approximation for Traveling Salesman Problems with profits.
Theor. Comput. Sci., 2014

Incomplete service and split deliveries in a routing problem with profits.
Networks, 2014

The split delivery capacitated team orienteering problem.
Networks, 2014

The locomotive assignment problem: a survey on optimization models.
ITOR, 2014

Formulations for an inventory routing problem.
ITOR, 2014

Twenty years of linear programming based portfolio optimization.
European Journal of Operational Research, 2014

A heuristic for BILP problems: The Single Source Capacitated Facility Location Problem.
European Journal of Operational Research, 2014

The distance constrained multiple vehicle traveling purchaser problem.
European Journal of Operational Research, 2014

Branch-and-cut algorithms for the split delivery vehicle routing problem.
European Journal of Operational Research, 2014

Polynomial cases of the economic lot sizing problem with cost discounts.
European Journal of Operational Research, 2014

The directed profitable location Rural Postman Problem.
European Journal of Operational Research, 2014

A survey on matheuristics for routing problems.
EURO J. Computational Optimization, 2014

Special issue on: "matheuristics".
EURO J. Computational Optimization, 2014

An ILP-refined tabu search for the Directed Profitable Rural Postman Problem.
Discrete Applied Mathematics, 2014

The Value Of Integration In Logistics.
Proceedings of the 28th European Conference on Modelling and Simulation, 2014

2013
The capacitated team orienteering problem with incomplete service.
Optimization Letters, 2013

A branch-and-bound algorithm for the double travelling salesman problem with two stacks.
Networks, 2013

Inventory routing problems with multiple customers.
EURO J. Transportation and Logistics, 2013

Editorial.
EURO J. Computational Optimization, 2013

Optimal solutions for routing problems with profits.
Discrete Applied Mathematics, 2013

Reoptimizing the rural postman problem.
Computers & OR, 2013

2012
A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks.
Networks, 2012

Vehicle routing problems with split deliveries.
ITOR, 2012

CORAL: An Exact Algorithm for the Multidimensional Knapsack Problem.
INFORMS Journal on Computing, 2012

A Hybrid Heuristic for an Inventory Routing Problem.
INFORMS Journal on Computing, 2012

Kernel search for the capacitated facility location problem.
J. Heuristics, 2012

Kernel Search: An application to the index tracking problem.
European Journal of Operational Research, 2012

Editorial.
EURO J. Transportation and Logistics, 2012

Inventory routing problems: an introduction.
EURO J. Transportation and Logistics, 2012

Kernel Search: a new heuristic framework for portfolio selection.
Comp. Opt. and Appl., 2012

2011
A column generation approach for the split delivery vehicle routing problem.
Networks, 2011

Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi on-line scheduling.
J. Comb. Optim., 2011

Analysis of the maximum level policy in a production-distribution system.
Computers & OR, 2011

2010
Geometric representation for semi on-line scheduling on uniform processors.
Optimization Methods and Software, 2010

Exact solutions to the double travelling salesman problem with multiple stacks.
Networks, 2010

Comparison of policies in dynamic routing problems.
JORS, 2010

Reoptimizing the 0-1 knapsack problem.
Discrete Applied Mathematics, 2010

The undirected capacitated arc routing problem with profits.
Computers & OR, 2010

Kernel search: A general heuristic for the multi-dimensional knapsack problem.
Computers & OR, 2010

2009
The capacitated team orienteering and profitable tour problems.
JORS, 2009

On the effectiveness of scenario generation techniques in single-period portfolio optimization.
European Journal of Operational Research, 2009

2008
An Optimization-Based Heuristic for the Split Delivery Vehicle Routing Problem.
Transportation Science, 2008

Semi-online scheduling on two uniform processors.
Theor. Comput. Sci., 2008

2007
A Branch-and-Cut Algorithm for a Vendor-Managed Inventory-Routing Problem.
Transportation Science, 2007

Competitive analysis of a dispatch policy for a dynamic multi-period routing problem.
Oper. Res. Lett., 2007

Competitive analysis for dynamic multiperiod uncapacitated routing problems.
Networks, 2007

Metaheuristics for the team orienteering problem.
J. Heuristics, 2007

Editorial.
Computers & OR, 2007

Conditional value at risk and related linear programming models for portfolio optimization.
Annals OR, 2007

2006
Worst-Case Analysis for Split Delivery Vehicle Routing Problems.
Transportation Science, 2006

A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem.
Transportation Science, 2006

New bounds and algorithms for on-line scheduling: two identical processors, known sum and upper bound on the tasks.
Discrete Mathematics & Theoretical Computer Science, 2006

Preface.
Annals OR, 2006

An Overview on the Split Delivery Vehicle Routing Problem.
Proceedings of the Operations Research, 2006

2005
Complexity and Reducibility of the Skip Delivery Problem.
Transportation Science, 2005

Minimizing the Total Cost in an Integrated Vendor - Managed Inventory System.
J. Heuristics, 2005

Improved rounding procedures for the discrete version of the capacitated EOQ problem.
European Journal of Operational Research, 2005

2004
The On-Line Multiprocessor Scheduling Problem with Known Sum of the Tasks.
J. Scheduling, 2004

Vehicle routing in the 1-skip collection problem.
JORS, 2004

Scheduling groups of tasks with precedence constraints on three dedicated processors.
Discrete Applied Mathematics, 2004

An improved heuristic for the period traveling salesman problem.
Computers & OR, 2004

2003
Reoptimizing the traveling salesman problem.
Networks, 2003

An efficient fully polynomial approximation scheme for the Subset-Sum Problem.
J. Comput. Syst. Sci., 2003

On LP Solvable Models for Portfolio Selection.
Informatica, Lith. Acad. Sci., 2003

Semi-Absolute Deviation Rule for Mutual Funds Portfolio Selection.
Annals OR, 2003

Semi-On-line Scheduling on Two Parallel Processors with an Upper Bound on the Items.
Algorithmica, 2003

2002
Continuous and Discrete Shipping Strategies for the Single Link Problem.
Transportation Science, 2002

Deterministic Order-Up-To Level Policies in an Inventory Routing Problem.
Transportation Science, 2002

The periodic vehicle routing problem with intermediate facilities.
European Journal of Operational Research, 2002

2001
Rounding Procedures for the Discrete Version of the Capacitated Economic Order Quantity Problem.
Annals OR, 2001

2000
Two linear approximation algorithms for the subset-sum problem.
European Journal of Operational Research, 2000

Selecting Portfolios with Fixed Costs and Minimum Transaction Lots.
Annals OR, 2000

1999
Heuristic algorithms for the portfolio selection problem with minimum transaction lots.
European Journal of Operational Research, 1999

Approximation Algorithms for Partitioning Small Items in Unequal Bins to Minimize the Total Size.
Discrete Applied Mathematics, 1999

On-line approximation algorithms for scheduling tasks on identical machines withextendable working time.
Annals OR, 1999

1998
A 13/12 Approximation Algorithm for Bin Packing with Extendable Bins.
Inf. Process. Lett., 1998

Heuristics for multimode scheduling problems with dedicated resources.
European Journal of Operational Research, 1998

A linear programming model for the separate refuse collection service.
Computers & OR, 1998

1997
Semi on-line algorithms for the partition problem.
Oper. Res. Lett., 1997

An Approximation Result for a Duo-Processor Task Scheduling Problem.
Inf. Process. Lett., 1997

Efficiency and effectiveness of normal schedules on three dedicated processors.
Discrete Mathematics, 1997

Scheduling at Villa Vigoni.
Discrete Applied Mathematics, 1997

Comparability Graph Augmentation for some Multiprocessor Scheduling Problems.
Discrete Applied Mathematics, 1997

An Efficient Approximation Scheme for the Subset-Sum Problem.
Proceedings of the Algorithms and Computation, 8th International Symposium, 1997

1996
A heuristic algorithm for a portfolio optimization model applied to the Milan stock market.
Computers & OR, 1996

1995
Scheduling Independent Tasks with Multiple Modes.
Discrete Applied Mathematics, 1995

1994
Corrigendum: Scheduling Multiprocessor Tasks on Three Dedicated Processors.
Inf. Process. Lett., 1994

Minimizing Transportation and Inventory Costs for Several Products on a Single Link.
Operations Research, 1994

1992
Scheduling Multiprocessor Tasks on Three Dedicated Processors.
Inf. Process. Lett., 1992

1984
The density function of the number of moves to complete the Towers of Hanoi puzzle.
Annals OR, 1984

Randomized algorithms: An annotated bibliography - In alphabetical order.
Annals OR, 1984


  Loading...