Juan José Salazar González

Eur. J. Oper. Res., March, 2024

2023

An efficient multistart heuristic for the driver and vehicle routing problem.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2023

2022

A Branch-and-cut algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2022

Tool Switching Problems in the Context of Overlay Printing with Multiple Colours.

[BibT_eX]

[DOI]

Manuel Iori

Alberto Locatelli

Marco Locatelli

Proceedings of the Combinatorial Optimization - 7th International Symposium, 2022

The Biobjective Consistent Traveling Salesman Problem.

[BibT_eX]

[DOI]

Daniel Díaz-Ríos

Proceedings of the Computational Logistics - 13th International Conference, 2022

2021

A Branch-and-Price Algorithm for the Vehicle Routing Problem with Stochastic Demands and Probabilistic Duration Constraints.

[BibT_eX]

[DOI]

Alexandre M. Florio

Richard F. Hartl

Stefan Minner

Transp. Sci., 2021

The Pickup and Delivery Problem with Split Loads and Transshipments: A Branch-and-Cut Solution Approach.

[BibT_eX]

[DOI]

David Wolfinger

Eur. J. Oper. Res., 2021

Selective routing problem with synchronization.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2021

2019

The probabilistic pickup-and-delivery travelling salesman problem.

[BibT_eX]

[DOI]

Enrique Benavent

Mercedes Landete

Gregorio Tirado

Expert Syst. Appl., 2019

The periodic vehicle routing problem with driver consistency.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2019

The Capacitated Vehicle Routing Problem: Stronger bounds in pseudo-polynomial time.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2019

Balanced vehicle routing: Polyhedral analysis and branch-and-cut algorithm.

[BibT_eX]

[DOI]

Tolga Bektas

Luis Gouveia

Antonio Martinez-Sykora

Eur. J. Oper. Res., 2019

Optimal Solutions for the Vehicle Routing Problem with Split Demands.

[BibT_eX]

[DOI]

Proceedings of the Computational Logistics - 10th International Conference, 2019

2018

Exact Approach for the Vehicle Routing Problem with Stochastic Demands and Preventive Returns.

[BibT_eX]

[DOI]

François V. Louveaux

Transp. Sci., 2018

The connected facility location polytope.

[BibT_eX]

[DOI]

Markus Leitner

Markus Sinnl

Discret. Appl. Math., 2018

Heuristic algorithm for the Split-Demand One-Commodity Pickup-and-Delivery Travelling Salesman Problem.

[BibT_eX]

[DOI]

Beatriz Santos-Hernández

Comput. Oper. Res., 2018

The driver and vehicle routing problem.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2018

An Exact Algorithm for the Split-Demand One-Commodity Pickup-and-delivery Travelling Salesman Problem.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization - 5th International Symposium, 2018

A Heuristic Approach to the Driver and Vehicle Routing Problem.

[BibT_eX]

[DOI]

Proceedings of the Computational Logistics - 9th International Conference, 2018

2017

Optimal Solutions to a Real-World Integrated Airline Scheduling Problem.

[BibT_eX]

[DOI]

Valentina Cacchiani

Transp. Sci., 2017

Solving the Team Orienteering Arc Routing Problem with a column generation approach.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2017

An algorithmic framework for the exact solution of tree-star problems.

[BibT_eX]

[DOI]

Markus Leitner

Markus Sinnl

Eur. J. Oper. Res., 2017

An exact algorithm for a Vehicle-and-Driver Scheduling Problem.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2017

2016

Solving the Single Vehicle Routing Problem with Variable Capacity.

[BibT_eX]

[DOI]

François V. Louveaux

Transp. Sci., 2016

The ring/<i>κ</i>-rings network design problem: Model and branch-and-cut algorithm.

[BibT_eX]

[DOI]

Networks, 2016

Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2016

A hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2016

Hierarchical Survivable Network Design Problems.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2016

A branch-and-cut algorithm for two-level survivable network design problems.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2016

Preface.

[BibT_eX]

[DOI]

Karl F. Doerner

Christian Stummer

Ann. Oper. Res., 2016

2015

Stronger multi-commodity flow formulations of the Capacitated Vehicle Routing Problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2015

2014

The multi-commodity pickup-and-delivery traveling salesman problem.

[BibT_eX]

[DOI]

Networks, 2014

A MIP-based approach to solve the prize-collecting local access network design problem.

[BibT_eX]

[DOI]

Peter Putz

Eur. J. Oper. Res., 2014

Single liner shipping service design.

[BibT_eX]

[DOI]

Christian E. M. Plum

David Pisinger

Mikkel Sigurd

Comput. Oper. Res., 2014

A branch-and-cut algorithm for the hub location and routing problem.

[BibT_eX]

[DOI]

María-Salomé Hernández-García

Comput. Oper. Res., 2014

Enhanced controlled tabular adjustment.

[BibT_eX]

[DOI]

María-Salomé Hernández-García

Comput. Oper. Res., 2014

Further Developments with Perturbation Techniques to Protect Tabular Data.

[BibT_eX]

[DOI]

Proceedings of the Privacy in Statistical Databases, 2014

On the Asymmetric Connected Facility Location Polytope.

[BibT_eX]

[DOI]

Markus Leitner

Markus Sinnl

Proceedings of the Combinatorial Optimization - Third International Symposium, 2014

Pickup-and-Delivery Problems for People Transportation.

[BibT_eX]

[DOI]

Karl F. Doerner

Luis Eduardo Neves Gouveia

Proceedings of the Vehicle Routing, 2014

2013

Polynomial-time separation of Enhanced Reverse Multistar inequalities.

[BibT_eX]

[DOI]

Luis Eduardo Neves Gouveia

Oper. Res. Lett., 2013

Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per route.

[BibT_eX]

[DOI]

Networks, 2013

International Network Optimization Conference, Tenerife 2013.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2013

A heuristic approach for an integrated fleet-assignment, aircraft-routing and crew-pairing problem.

[BibT_eX]

[DOI]

Valentina Cacchiani

Electron. Notes Discret. Math., 2013

A column generation approach for a school bus routing problem with resource constraints.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2013

The traveling purchaser problem, with multiple stacks and deliveries: A branch-and-cut approach.

[BibT_eX]

[DOI]

María Batista-Galván

Comput. Oper. Res., 2013

2012

Exact approaches to the single-source network loading problem.

[BibT_eX]

[DOI]

Peter Putz

Networks, 2012

The Balanced Minimum Evolution Problem.

[BibT_eX]

[DOI]

Daniele Catanzaro

Raffaele Pesenti

INFORMS J. Comput., 2012

A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem.

[BibT_eX]

[DOI]

J. Heuristics, 2012

Solving school bus routing using the multiple vehicle traveling purchaser problem: A branch-and-cut approach.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2012

2011

Generalized network design polyhedra.

[BibT_eX]

[DOI]

Corinne Feremans

Networks, 2011

Decorous Lower Bounds for Minimum Linear Arrangement.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2011

The Multi-Commodity One-to-One Pickup-and-Delivery Traveling Salesman Problem: A Matheuristic.

[BibT_eX]

[DOI]

Proceedings of the Network Optimization - 5th International Conference, 2011

A Heuristic Algorithm for a Prize-Collecting Local Access Network Design Problem.

[BibT_eX]

[DOI]

Peter Putz

Proceedings of the Network Optimization - 5th International Conference, 2011

2010

A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading.

[BibT_eX]

[DOI]

Jean-François Cordeau

Manuel Iori

Luis Eduardo Neves Gouveia

Networks, 2010

On the Vehicle Routing Problem with lower bound capacities.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2010

Lower Bounds for the Minimum Linear Arrangement of a Graph.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2010

Hybridization of very large neighborhood search for ready-mixed concrete delivery problems.

[BibT_eX]

[DOI]

Verena Schmid

Karl F. Doerner

Richard F. Hartl

Comput. Oper. Res., 2010

A local branching heuristic for the capacitated fixed-charge network design problem.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2010

Branch-and-Cut versus Cut-and-Branch Algorithms for Cell Suppression.

[BibT_eX]

[DOI]

Proceedings of the Privacy in Statistical Databases, 2010

2009

Mathematical models to reconstruct phylogenetic trees under the minimum evolution criterion.

[BibT_eX]

[DOI]

Daniele Catanzaro

Raffaele Pesenti

Networks, 2009

On the one-commodity pickup-and-delivery traveling salesman problem with stochastic demands.

[BibT_eX]

[DOI]

François V. Louveaux

Math. Program., 2009

The multi-commodity one-to-one pickup-and-delivery traveling salesman problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2009

A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2009

2008

A new approach for data editing and imputation.

[BibT_eX]

[DOI]

Sergio Delgado-Quintero

Math. Methods Oper. Res., 2008

Solving a capacitated hub location problem.

[BibT_eX]

[DOI]

André Renato Sales Amaral

Eur. J. Oper. Res., 2008

A New Lower Bound for the Minimum Linear Arrangement of a Graph.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2008

Statistical confidentiality: Optimization techniques to protect tables.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2008

2007

An Exact Approach for the Vehicle Routing Problem with Two-Dimensional Loading Constraints.

[BibT_eX]

[DOI]

Manuel Iori

Daniele Vigo

Transp. Sci., 2007

The one-commodity pickup-and-delivery traveling salesman problem: Inequalities and algorithms.

[BibT_eX]

[DOI]

Networks, 2007

An algorithm for checking whether the toric ideal of an affine monomial curve is a complete intersection.

[BibT_eX]

[DOI]

Isabel Bermejo

Ignacio García-Marco

J. Symb. Comput., 2007

A branch-and-cut algorithm for the continuous error localization problem in data cleaning.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2007

A heuristic approach for the continuous error localization problem in data cleaning.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2007

2006

Projection results for vehicle routing.

[BibT_eX]

[DOI]

Math. Program., 2006

Controlled rounding and cell perturbation: statistical disclosure limitation methods for tabular data.

[BibT_eX]

[DOI]

Math. Program., 2006

Solving the asymmetric traveling purchaser problem.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2006

A New Approach to Round Tabular Data.

[BibT_eX]

[DOI]

Proceedings of the Privacy in Statistical Databases, 2006

An Iterated Local Search Heuristic for a Capacitated Hub Location Problem.

[BibT_eX]

[DOI]

Proceedings of the Hybrid Metaheuristics, Third International Workshop, 2006

2005

A Unified Mathematical Programming Framework for Different Statistical Disclosure Limitation Methods.

[BibT_eX]

[DOI]

Oper. Res., 2005

Laying Out Sparse Graphs with Provably Minimum Bandwidth.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2005

The biobjective travelling purchaser problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2005

A heuristic approach for the Travelling Purchaser Problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2005

Locating median cycles in networks.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2005

2004

Heuristics for the One-Commodity Pickup-and-Delivery Traveling Salesman Problem.

[BibT_eX]

[DOI]

Transp. Sci., 2004

The Ring Star Problem: Polyhedral analysis and exact algorithm.

[BibT_eX]

[DOI]

Networks, 2004

A branch-and-cut algorithm for the plant-cycle location problem.

[BibT_eX]

[DOI]

J. Oper. Res. Soc., 2004

Mathematical models for applying cell suppression methodology in statistical data protection.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2004

A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

A New Tool for Applying Controlled Rounding to a Statistical Table in Microsoft Excel.

[BibT_eX]

[DOI]

Markus Schoch

Proceedings of the Privacy in Statistical Databases: CASC Project International Workshop, 2004

Getting the Best Results in Controlled Rounding with the Least Effort.

[BibT_eX]

[DOI]

Proceedings of the Privacy in Statistical Databases: CASC Project International Workshop, 2004

Decomposition Approaches for a Capacitated Hub Problem.

[BibT_eX]

[DOI]

Proceedings of the Advances in Artificial Intelligence, 2004

2003

Partial cell suppression: A new methodology for statistical disclosure control.

[BibT_eX]

[DOI]

Stat. Comput., 2003

Some recent contributions to routing and location problems.

[BibT_eX]

[DOI]

Angel Corberán

Enrique Mota

Networks, 2003

A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem.

[BibT_eX]

[DOI]

Oper. Res., 2003

The Steiner cycle polytope.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2003

Optimisation of the interconnecting network of a UMTS radio mobile telephone system.

[BibT_eX]

[DOI]

Giorgio Romanin-Jacur

Eur. J. Oper. Res., 2003

2002

Extending Cell Suppression to Protect Tabular Data against Several Attackers.

[BibT_eX]

[DOI]

Proceedings of the Inference Control in Statistical Databases, From Theory to Practice, 2002

2001

Solving the Cell Suppression Problem on Tabular Data with Linear Constraints.

[BibT_eX]

[DOI]

Manag. Sci., 2001

The One-Commodity Pickup-and-Delivery Travelling Salesman Problem.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization, 2001

2000

A note on the generalized steiner tree polytope.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2000

1999

Models and algorithms for the 2-dimensional cell suppression problem in statistical disclosure control.

[BibT_eX]

[DOI]

Math. Program., 1999

Separating Lifted Odd-hole Inequalities to Solve the Index Selection Problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1999

1998

Solving the Orienteering Problem through Branch-and-Cut.

[BibT_eX]

[DOI]

Paolo Toth

INFORMS J. Comput., 1998

1997

A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem.

[BibT_eX]

[DOI]

Paolo Toth

Oper. Res., 1997

1995

The symmetric generalized traveling salesman polytope.

[BibT_eX]

[DOI]