Antonio Sforza
Orcid: 0000-0003-3117-6810
According to our database1,
Antonio Sforza
authored at least 29 papers
between 1999 and 2021.
Collaborative distances:
Collaborative distances:
Timeline
2000
2005
2010
2015
2020
0
1
2
3
4
5
1
3
4
1
1
1
1
1
2
1
1
3
2
1
1
1
1
1
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2021
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
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
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
Int. J. Syst. Syst. Eng., 2013
Proceedings of the Critical Information Infrastructures Security, 2013
2011
4OR, 2011
2010
Proceedings of the Experimental Algorithms, 9th International Symposium, 2010
2009
J. Math. Model. Algorithms, 2009
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 decomposition approach for a very large scale optimal diversity management problem.
4OR, 2005
2004
J. Math. Model. Algorithms, 2004
Eur. J. Oper. Res., 2004
2002
Eur. J. Oper. Res., 2002
1999