Maria Grazia Speranza

Central Eur. J. Oper. Res., June, 2024

Vehicle routing problems with multiple commodities: A survey.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2024

The one-station bike repositioning problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2024

2023

Trends in passenger transport optimisation.

[BibT_eX]

[DOI]

Lorenzo Peirano

Int. Trans. Oper. Res., November, 2023

Tutorials and Reviews in Operations Research.

[BibT_eX]

[DOI]

Luce Brotcorne

Mario Guajardo

Celso C. Ribeiro

Juan Carlos Martínez Mori

Int. Trans. Oper. Res., November, 2023

On the Value of Dynamism in Transit Networks.

[BibT_eX]

[DOI]

Samitha Samaranayake

Transp. Sci., May, 2023

The benefit of complete trip information in free-floating carsharing systems.

[BibT_eX]

[DOI]

Maurizio Bruglieri

EURO J. Transp. Logist., 2023

2022

Optimization in multimodal freight transportation problems: A Survey.

[BibT_eX]

[DOI]

Lorenzo Peirano

Eur. J. Oper. Res., 2022

A sequential approach for a multi-commodity two-echelon distribution problem.

[BibT_eX]

[DOI]

Comput. Ind. Eng., 2022

A simulation framework for a station-based bike-sharing system.

[BibT_eX]

[DOI]

Massimo Chiari

Comput. Ind. Eng., 2022

Trends in Transportation and Logistics and the Role of Optimization.

[BibT_eX]

Proceedings of the 3rd International Conference on Innovative Intelligent Industrial Production and Logistics, 2022

2021

A kernel search heuristic for the multivehicle inventory routing problem.

[BibT_eX]

[DOI]

Diana L. Huerta-Muñoz

Int. Trans. Oper. Res., 2021

On single-source capacitated facility location with cost and fairness objectives.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2021

System optimal routing of traffic flows with user constraints using linear programming.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2021

A kernel search heuristic for a fair facility location problem.

[BibT_eX]

[DOI]

Diana L. Huerta-Muñoz

Comput. Oper. Res., 2021

The Bi-Objective Long-Haul Transportation Problem on a Road Network (Invited Talk).

[BibT_eX]

[DOI]

Proceedings of the 27th International Conference on Principles and Practice of Constraint Programming, 2021

2020

Conditional value-at-risk beyond finance: a survey.

[BibT_eX]

[DOI]

Int. Trans. Oper. Res., 2020

A branch-and-cut algorithm for the inventory routing problem with pickups and deliveries.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2020

Dynamic traveling salesman problem with stochastic release dates.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2020

Minimizing the total travel time with limited unfairness in traffic networks.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2020

Enhanced index tracking with CVaR-based ratio measures.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2020

Vehicle routing problems over time: a survey.

[BibT_eX]

[DOI]

4OR, 2020

2019

Flexible two-echelon location routing problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2019

Exact solution methods for the multi-period vehicle routing problem with due dates.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2019

Bridging <i>k</i>-sum and CVaR optimization in MILP.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2019

The pickup and delivery problem with time windows and occasional drivers.

[BibT_eX]

[DOI]

Lars Dahle

Henrik Andersson

Marielle Christiansen

Comput. Oper. Res., 2019

A trade-off between average and maximum arc congestion minimization in traffic assignment with user constraints.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2019

A branch-and-cut algorithm for the multi-compartment vehicle routing problem with flexible compartment sizes.

[BibT_eX]

[DOI]

Tino Henke

Gerhard Wäscher

Ann. Oper. Res., 2019

2018

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

[BibT_eX]

[DOI]

Int. Trans. Oper. Res., 2018

A simulation study of an on-demand transportation system.

[BibT_eX]

[DOI]

Dennis Weyland

Int. Trans. Oper. Res., 2018

Trends in transportation and logistics.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2018

The Shared Customer Collaboration Vehicle Routing Problem.

[BibT_eX]

[DOI]

Elena Fernández

Mireia Roca-Riu

Eur. J. Oper. Res., 2018

Inventory routing with pickups and deliveries.

[BibT_eX]

[DOI]

Marielle Christiansen

Eur. J. Oper. Res., 2018

Comparing sequential and integrated approaches for the production routing problem.

[BibT_eX]

[DOI]

Nabil Absi

Stéphane Dauzère-Pérès

Eur. J. Oper. Res., 2018

An iterated local search for the Traveling Salesman Problem with release dates and completion time minimization.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2018

Congestion avoiding heuristic path generation for the proactive route guidance.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2018

2017

A Matheuristic for the Multivehicle Inventory Routing Problem.

[BibT_eX]

[DOI]

Natashia Boland

INFORMS J. Comput., 2017

Adaptive Kernel Search: A heuristic for solving Mixed Integer linear Programs.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2017

The value of integrating loading and routing.

[BibT_eX]

[DOI]

Jean-François Côté

Eur. J. Oper. Res., 2017

Minimizing the logistic ratio in the inventory routing problem.

[BibT_eX]

[DOI]

Guy Desaulniers

EURO J. Transp. Logist., 2017

2016

Intermediate Facilities in Freight Transportation Planning: A Survey.

[BibT_eX]

[DOI]

Daniele Vigo

Transp. Sci., 2016

Multicommodity vs. Single-Commodity Routing.

[BibT_eX]

[DOI]

Ann Melissa Campbell

Transp. Sci., 2016

The inventory routing problem: the value of integration.

[BibT_eX]

[DOI]

Int. Trans. Oper. Res., 2016

Linear programming models based on Omega ratio for the Enhanced Index Tracking Problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2016

The Vehicle Routing Problem with Occasional Drivers.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2016

On the Collaboration Uncapacitated Arc Routing Problem.

[BibT_eX]

[DOI]

Elena Fernández

Dario Fontana

Comput. Oper. Res., 2016

A branch-and-cut algorithm for the Orienteering Arc Routing Problem.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2016

2015

The Vehicle Routing Problem with Divisible Deliveries and Pickups.

[BibT_eX]

[DOI]

Gábor Nagy

Niaz A. Wassan

Transp. Sci., 2015

The multi-compartment vehicle routing problem with flexible compartment sizes.

[BibT_eX]

[DOI]

Tino Henke

Gerhard Wäscher

Eur. J. Oper. Res., 2015

Complexity of routing problems with release dates.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2015

A matheuristic for the Team Orienteering Arc Routing Problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2015

A survey on two-echelon routing problems.

[BibT_eX]

[DOI]

R. Cuda

Comput. Oper. Res., 2015

Multi-period Vehicle Routing Problem with Due dates.

[BibT_eX]

[DOI]

Ola Jabali

Comput. Oper. Res., 2015

A branch-price-and-cut algorithm for the commodity constrained split delivery vehicle routing problem.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2015

2014

The Team Orienteering Arc Routing Problem.

[BibT_eX]

[DOI]

Angel Corberán

José M. Sanchis

Isaac Plana

Transp. Sci., 2014

Complexity and approximation for Traveling Salesman Problems with profits.

[BibT_eX]

[DOI]

Cristina Bazgan

Theor. Comput. Sci., 2014

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

[BibT_eX]

[DOI]

Networks, 2014

The split delivery capacitated team orienteering problem.

[BibT_eX]

[DOI]

Networks, 2014

The locomotive assignment problem: a survey on optimization models.

[BibT_eX]

[DOI]

F. Piu

Int. Trans. Oper. Res., 2014

Formulations for an inventory routing problem.

[BibT_eX]

[DOI]

Int. Trans. Oper. Res., 2014

Twenty years of linear programming based portfolio optimization.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2014

A heuristic for BILP problems: The Single Source Capacitated Facility Location Problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2014

The distance constrained multiple vehicle traveling purchaser problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2014

Branch-and-cut algorithms for the split delivery vehicle routing problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2014

Polynomial cases of the economic lot sizing problem with cost discounts.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2014

The directed profitable location Rural Postman Problem.

[BibT_eX]

[DOI]

Claudio Arbib

Mara Servilio

Eur. J. Oper. Res., 2014

A survey on matheuristics for routing problems.

[BibT_eX]

[DOI]

EURO J. Comput. Optim., 2014

Special issue on: "matheuristics".

[BibT_eX]

[DOI]

David Pisinger

EURO J. Comput. Optim., 2014

An ILP-refined tabu search for the Directed Profitable Rural Postman Problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

The Value Of Integration In Logistics.

[BibT_eX]

[DOI]

Proceedings of the 28th European Conference on Modelling and Simulation, 2014

Vehicle Routing Problems with Profits.

[BibT_eX]

[DOI]

Daniele Vigo

Proceedings of the Vehicle Routing, 2014

2013

The capacitated team orienteering problem with incomplete service.

[BibT_eX]

[DOI]

Optim. Lett., 2013

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

[BibT_eX]

[DOI]

Francesco Carrabs

Raffaele Cerulli

Networks, 2013

Inventory routing problems with multiple customers.

[BibT_eX]

[DOI]

EURO J. Transp. Logist., 2013

Editorial.

[BibT_eX]

[DOI]

Martine Labbé

EURO J. Comput. Optim., 2013

Optimal solutions for routing problems with profits.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

Reoptimizing the rural postman problem.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2013

2012

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

[BibT_eX]

[DOI]

Jean-François Côté

Michel Gendreau

Jean-Yves Potvin

Networks, 2012

Vehicle routing problems with split deliveries.

[BibT_eX]

[DOI]

Int. Trans. Oper. Res., 2012

CORAL: An Exact Algorithm for the Multidimensional Knapsack Problem.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2012

A Hybrid Heuristic for an Inventory Routing Problem.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2012

Kernel search for the capacitated facility location problem.

[BibT_eX]

[DOI]

J. Heuristics, 2012

Kernel Search: An application to the index tracking problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2012

Editorial.

[BibT_eX]

[DOI]

Michel Bierlaire

EURO J. Transp. Logist., 2012

Inventory routing problems: an introduction.

[BibT_eX]

[DOI]

EURO J. Transp. Logist., 2012

Kernel Search: a new heuristic framework for portfolio selection.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2012

2011

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

[BibT_eX]

[DOI]

Networks, 2011

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

[BibT_eX]

[DOI]

György Dósa

J. Comb. Optim., 2011

Analysis of the maximum level policy in a production-distribution system.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2011

2010

Geometric representation for semi on-line scheduling on uniform processors.

[BibT_eX]

[DOI]

József Szoldatics

Optim. Methods Softw., 2010

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

[BibT_eX]

[DOI]

Hanne L. Petersen

Networks, 2010

Comparison of policies in dynamic routing problems.

[BibT_eX]

[DOI]

J. Oper. Res. Soc., 2010

Reoptimizing the 0-1 knapsack problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2010

The undirected capacitated arc routing problem with profits.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2010

Kernel search: A general heuristic for the multi-dimensional knapsack problem.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2010

2009

The capacitated team orienteering and profitable tour problems.

[BibT_eX]

[DOI]

J. Oper. Res. Soc., 2009

On the effectiveness of scenario generation techniques in single-period portfolio optimization.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2009

2008

An Optimization-Based Heuristic for the Split Delivery Vehicle Routing Problem.

[BibT_eX]

[DOI]

Transp. Sci., 2008

Semi-online scheduling on two uniform processors.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

2007

A Branch-and-Cut Algorithm for a Vendor-Managed Inventory-Routing Problem.

[BibT_eX]

[DOI]

Gilbert Laporte

Transp. Sci., 2007

Semi on-line scheduling on three processors with known sum of the tasks.

[BibT_eX]

[DOI]

J. Sched., 2007

Competitive analysis of a dispatch policy for a dynamic multi-period routing problem.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2007

Competitive analysis for dynamic multiperiod uncapacitated routing problems.

[BibT_eX]

[DOI]

Networks, 2007

Metaheuristics for the team orienteering problem.

[BibT_eX]

[DOI]

J. Heuristics, 2007

Editorial.

[BibT_eX]

[DOI]

Raffaele Pesenti

Comput. Oper. Res., 2007

Conditional value at risk and related linear programming models for portfolio optimization.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2007

2006

Worst-Case Analysis for Split Delivery Vehicle Routing Problems.

[BibT_eX]

[DOI]

Transp. Sci., 2006

A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem.

[BibT_eX]

[DOI]

Transp. Sci., 2006

New bounds and algorithms for on-line scheduling: two identical processors, known sum and upper bound on the tasks.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2006

Preface.

[BibT_eX]

[DOI]

Martine Labbé

José Pinto Paixão

Ann. Oper. Res., 2006

An Overview on the Split Delivery Vehicle Routing Problem.

[BibT_eX]

[DOI]

Proceedings of the Operations Research, 2006

2005

Complexity and Reducibility of the Skip Delivery Problem.

[BibT_eX]

[DOI]

Transp. Sci., 2005

Minimizing the Total Cost in an Integrated Vendor - Managed Inventory System.

[BibT_eX]

[DOI]

J. Heuristics, 2005

Improved rounding procedures for the discrete version of the capacitated EOQ problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2005

2004

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

[BibT_eX]

[DOI]

Á. B. Nagy

J. Sched., 2004

Vehicle routing in the 1-skip collection problem.

[BibT_eX]

[DOI]

J. Oper. Res. Soc., 2004

Scheduling groups of tasks with precedence constraints on three dedicated processors.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

An improved heuristic for the period traveling salesman problem.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2004

2003

Reoptimizing the traveling salesman problem.

[BibT_eX]

[DOI]

Networks, 2003

An efficient fully polynomial approximation scheme for the Subset-Sum Problem.

[BibT_eX]

[DOI]

Ulrich Pferschy

J. Comput. Syst. Sci., 2003

On LP Solvable Models for Portfolio Selection.

[BibT_eX]

[DOI]

Informatica, 2003

Semi-Absolute Deviation Rule for Mutual Funds Portfolio Selection.

[BibT_eX]

[DOI]

Luca Chiodi

Ann. Oper. Res., 2003

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

[BibT_eX]

[DOI]

Algorithmica, 2003

2002

Continuous and Discrete Shipping Strategies for the Single Link Problem.

[BibT_eX]

[DOI]

Transp. Sci., 2002

Deterministic Order-Up-To Level Policies in an Inventory Routing Problem.

[BibT_eX]

[DOI]

Transp. Sci., 2002

A multidimensional knapsack model for asset-backed securitization.

[BibT_eX]

[DOI]

J. Oper. Res. Soc., 2002

The application of a vehicle routing model to a waste-collection problem: two case studies.

[BibT_eX]

[DOI]

J. Oper. Res. Soc., 2002

The periodic vehicle routing problem with intermediate facilities.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2002

2001

Rounding Procedures for the Discrete Version of the Capacitated Economic Order Quantity Problem.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2001

2000

Two linear approximation algorithms for the subset-sum problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2000

Selecting Portfolios with Fixed Costs and Minimum Transaction Lots.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2000

1999

Heuristic algorithms for the portfolio selection problem with minimum transaction lots.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 1999

Approximation Algorithms for Partitioning Small Items in Unequal Bins to Minimize the Total Size.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1999

On-line approximation algorithms for scheduling tasks on identical machines withextendable working time.

[BibT_eX]

[DOI]

Ann. Oper. Res., 1999

1998

A 13/12 Approximation Algorithm for Bin Packing with Extendable Bins.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1998

Heuristics for multimode scheduling problems with dedicated resources.

[BibT_eX]

[DOI]

Lucio Bianco

Eur. J. Oper. Res., 1998

A linear programming model for the separate refuse collection service.

[BibT_eX]

[DOI]

Comput. Oper. Res., 1998

1997

Semi on-line algorithms for the partition problem.

[BibT_eX]

[DOI]

Vladimir Kotov

Oper. Res. Lett., 1997

An Approximation Result for a Duo-Processor Task Scheduling Problem.

[BibT_eX]

[DOI]

Stefano Giordani

Inf. Process. Lett., 1997

Efficiency and effectiveness of normal schedules on three dedicated processors.

[BibT_eX]

[DOI]

Discret. Math., 1997

Scheduling at Villa Vigoni.

[BibT_eX]

[DOI]

Rolf H. Möhring

Franz Josef Radermacher

Discret. Appl. Math., 1997

Comparability Graph Augmentation for some Multiprocessor Scheduling Problems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1997

An Efficient Approximation Scheme for the Subset-Sum Problem.

[BibT_eX]

[DOI]

Ulrich Pferschy

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.

[BibT_eX]

[DOI]

Comput. Oper. Res., 1996

1995

Scheduling Independent Tasks with Multiple Modes.

[BibT_eX]

[DOI]

Lucio Bianco

Discret. Appl. Math., 1995

1994

Corrigendum: Scheduling Multiprocessor Tasks on Three Dedicated Processors.

[BibT_eX]

Jacek Blazewicz

Maciej Drozdowski

Inf. Process. Lett., 1994

Minimizing Transportation and Inventory Costs for Several Products on a Single Link.

[BibT_eX]

[DOI]

Walter Ukovich

Oper. Res., 1994

1992

Scheduling Multiprocessor Tasks on Three Dedicated Processors.

[BibT_eX]

[DOI]

Jacek Blazewicz

Maciej Drozdowski

Inf. Process. Lett., 1992

1984

The density function of the number of moves to complete the Towers of Hanoi puzzle.

[BibT_eX]

[DOI]

F. Scarioni

Ann. Oper. Res., 1984

Randomized algorithms: An annotated bibliography - In alphabetical order.

[BibT_eX]

[DOI]

Francesco Maffioli