Antonio Sforza

According to our database1, Antonio Sforza authored at least 29 papers between 1999 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2021
An integrated user-system approach for shelter location and evacuation routing.
Networks, 2021

2020
Constrained two-dimensional guillotine cutting problem: upper-bound review and categorization.
Int. Trans. Oper. Res., 2020

Simple Pattern Minimality Problems: Integer Linear Programming Formulations and Covering-Based Heuristic Solving Approaches.
INFORMS J. Comput., 2020

A branch-and-cut algorithm for the inventory routing problem with pickups and deliveries.
Eur. J. Oper. Res., 2020

Optimal Location of Welds on the Vehicle Wiring Harness: P-Median Based Exact and Heuristic Approaches.
Proceedings of the Mathematical Optimization Theory and Operations Research, 2020

2019
An effective heuristic for large-scale fault-tolerant k-median problem.
Soft Comput., 2019

Sustainability-based review of urban freight models.
Soft Comput., 2019

The Minimum Routing Cost Tree Problem - State of the art and a core-node based heuristic algorithm.
Soft Comput., 2019

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

2018
Multi-commodity location-routing: Flow intercepting formulation and branch-and-cut algorithm.
Comput. Oper. Res., 2018

2016
A unified solving approach for two and three dimensional coverage problems in sensor networks.
Optim. Lett., 2016

Railway Station Surveillance System Design: A Real Application of an Optimal Coverage Approach.
Proceedings of the Critical Information Infrastructures Security, 2016

2015
Joint content-resource allocation in software defined virtual CDNs.
Proceedings of the IEEE International Conference on Communication, 2015

2014
An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems.
Comput. Oper. Res., 2014

2013
Optimal location of flow intercepting facilities to improve security in urban areas.
Int. J. Syst. Syst. Eng., 2013

Optimization Models in a Smart Tool for the Railway Infrastructure Protection.
Proceedings of the Critical Information Infrastructures Security, 2013

2011
A fast heuristic for a three-dimensional non-convex domain loading problem.
4OR, 2011

2010
A Metaheuristic for a Two Echelon Location-Routing Problem.
Proceedings of the Experimental Algorithms, 9th International Symposium, 2010

2009
Flow Intercepting Facility Location: Problems, Models and Heuristics.
J. Math. Model. Algorithms, 2009

An effective heuristic for large-scale capacitated facility location problems.
J. Heuristics, 2009

2008
A Cut and Branch Approach for the Capacitated <i>p</i>-Median Problem Based on Fenchel Cutting Planes.
J. Math. Model. Algorithms, 2008

2007
Capacitated lot sizing and scheduling with parallel machines and shared buffers: A case study in a packaging company.
Ann. Oper. Res., 2007

2005
A Steiner arborescence model for the feeder reconfiguration in electric distribution networks.
Eur. J. Oper. Res., 2005

A Branch-and-Cut Algorithm for the Median-Path Problem.
Comput. Optim. Appl., 2005

A decomposition approach for a very large scale optimal diversity management problem.
4OR, 2005

2004
Resource Constrained Shortest Path Problems in Path Planning for Fleet Management.
J. Math. Model. Algorithms, 2004

Solving a fuel delivery problem by heuristic and exact approaches.
Eur. J. Oper. Res., 2004

2002
A penalty function heuristic for the resource constrained shortest path problem.
Eur. J. Oper. Res., 2002

1999
Logical reduction tests for the p-problem.
Ann. Oper. Res., 1999


  Loading...