Raffaele Cerulli

Santos Sánchez-Cambronero

Ana Rivas

Comput. Oper. Res., 2022

2021

A reduction heuristic for the all-colors shortest path problem.

[BibT_eX]

[DOI]

RAIRO Oper. Res., 2021

Grocery distribution plans in urban networks with street crossing penalties.

[BibT_eX]

[DOI]

Anna Sciomachen

Networks, 2021

The Generalized Minimum Branch Vertices Problem: Properties and Polyhedral Analysis.

[BibT_eX]

[DOI]

J. Optim. Theory Appl., 2021

Minimum spanning tree with conflicting edge pairs: a branch-and-cut approach.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2021

2020

Contrasting the Spread of Misinformation in Online Social Networks.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2020

An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for the Close-Enough Traveling Salesman Problem.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2020

The Knapsack Problem with Forfeits.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization - 6th International Symposium, 2020

2019

Preface: Special issue on network optimization in transportation, logistics, and industry.

[BibT_eX]

[DOI]

Antonio Sforza

Daniele Vigo

Networks, 2019

Exact approaches for the orderly colored longest path problem: Performance comparison.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2019

2018

The rainbow spanning forest problem.

[BibT_eX]

[DOI]

Soft Comput., 2018

On the complexity of rainbow spanning forest problem.

[BibT_eX]

[DOI]

Optim. Lett., 2018

Preface: Theoretical and algorithmic contributions to network optimization problems.

[BibT_eX]

[DOI]

Networks, 2018

The Set Orienteering Problem.

[BibT_eX]

[DOI]

Claudia Archetti

Eur. J. Oper. Res., 2018

A two-level metaheuristic for the all colors shortest path problem.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2018

2017

An exact approach for the grocery delivery problem in urban areas.

[BibT_eX]

[DOI]

Anna Sciomachen

Soft Comput., 2017

Exact and heuristic approaches for the maximum lifetime problem in sensor networks with coverage and connectivity constraints.

[BibT_eX]

[DOI]

RAIRO Oper. Res., 2017

An exact algorithm to extend lifetime through roles allocation in sensor networks with connectivity constraints.

[BibT_eX]

[DOI]

Optim. Lett., 2017

A branch-and-cut algorithm for the minimum branch vertices spanning tree problem.

[BibT_eX]

[DOI]

Selene Silvestri

Gilbert Laporte

Comput. Oper. Res., 2017

Carousel greedy: A generalized greedy algorithm with applications in optimization.

[BibT_eX]

[DOI]

Bruce L. Golden

Comput. Oper. Res., 2017

A novel discretization scheme for the close enough traveling salesman problem.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2017

Tactical Production and Lot Size Planning with Lifetime Constraints: A Comparison of Model Formulations.

[BibT_eX]

[DOI]

Asia Pac. J. Oper. Res., 2017

Source Reconstruction of Atmospheric Releases with Limited Meteorological Observations Using Genetic Algorithms.

[BibT_eX]

[DOI]

Appl. Artif. Intell., 2017

Prolonging Lifetime in Wireless Sensor Networks with Interference Constraints.

[BibT_eX]

[DOI]

Proceedings of the Green, Pervasive, and Cloud Computing - 12th International Conference, 2017

Improved Upper and Lower Bounds for the Close Enough Traveling Salesman Problem.

[BibT_eX]

[DOI]

Proceedings of the Green, Pervasive, and Cloud Computing - 12th International Conference, 2017

2016

OMEGA one multi ethnic genetic approach.

[BibT_eX]

[DOI]

Manlio Gaudioso

Optim. Lett., 2016

Models, algorithms and applications for location problems.

[BibT_eX]

[DOI]

Giuseppe Bruno

Optim. Lett., 2016

The Rainbow Cycle Cover Problem.

[BibT_eX]

[DOI]

Selene Silvestri

Gilbert Laporte

Networks, 2016

2015

A hybrid exact approach for maximizing lifetime in sensor networks with complete and partial coverage constraints.

[BibT_eX]

[DOI]

J. Netw. Comput. Appl., 2015

Vehicle-ID sensor location for route flow recognition: Models and algorithms.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2015

Maximizing lifetime in wireless sensor networks with multiple sensor families.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2015

2014

Maximizing lifetime and handling reliability in wireless sensor networks.

[BibT_eX]

[DOI]

Networks, 2014

Editorial.

[BibT_eX]

[DOI]

Networks, 2014

A memetic algorithm for the weighted feedback vertex set problem.

[BibT_eX]

[DOI]

Networks, 2014

Relations, models and a memetic approach for three degree-dependent spanning tree problems.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2014

Locating sensors to observe network arc flows: Exact and heuristic approaches.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2014

A Tabu Search Approach for the Circle Packing Problem.

[BibT_eX]

[DOI]

Proceedings of the 17th International Conference on Network-Based Information Systems, 2014

2013

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

[BibT_eX]

[DOI]

Maria Grazia Speranza

Networks, 2013

Comparison of heuristics for the colourful travelling salesman problem.

[BibT_eX]

[DOI]

Int. J. Metaheuristics, 2013

Lower and upper bounds for the spanning tree with minimum branch vertices.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2013

2012

Exact and heuristic methods to maximize network lifetime in wireless sensor networks with adjustable sensing ranges.

[BibT_eX]

[DOI]

R. De Donato

Eur. J. Oper. Res., 2012

2011

A Tabu Search Heuristic Based on k-Diamonds for the Weighted Feedback Vertex Set Problem.

[BibT_eX]

[DOI]

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

The maximum labeled clique problem.

[BibT_eX]

[DOI]

Paolo Dell'Olmo

Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011

2009

The labeled maximum matching problem.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2009

Bounded-degree spanning tree problems: models and new algorithms.

[BibT_eX]

[DOI]

Antonio Iossa

Comput. Optim. Appl., 2009

2008

Efficient preflow push algorithms.

[BibT_eX]

[DOI]

Antonio Iossa

Comput. Oper. Res., 2008

2007

An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading.

[BibT_eX]

[DOI]

Jean-François Cordeau

INFOR Inf. Syst. Oper. Res., 2007

2006

Heuristic approaches for the Minimum Labelling Hamiltonian Cycle Problem.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2006

2005

A linear time algorithm for the minimum Weighted Feedback Vertex Set on diamonds.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2005

2004

Minimum Weighted Feedback Vertex Set on Diamonds.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2004

2003

Shortest Path Auction Algorithm Without Contractions Using Virtual Source Concept.

[BibT_eX]

[DOI]

Paola Festa

Giancarlo Raiconi

Comput. Optim. Appl., 2003

1998

The Auction Technique for the Sensor Based Navigation Planning of an Autonomous Mobile Robot.

[BibT_eX]

[DOI]

J. Intell. Robotic Syst., 1998

1992

A class of manpower scheduling problems.

[BibT_eX]

[DOI]

Manlio Gaudioso

R. Mautone

ZOR Methods Model. Oper. Res., 1992

1988

Mean-variance approach to the management of cyclic deliveries.

[BibT_eX]

[DOI]