Claudio Sterle
Orcid: 0000-0002-2545-5306
According to our database1,
Claudio Sterle
authored at least 34 papers
between 2008 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
-
on d-nb.info
On csauthors.net:
Bibliography
2023
Networks, October, 2023
The parallel AGV scheduling problem with battery constraints: A new formulation and a matheuristic approach.
Eur. J. Oper. Res., June, 2023
2022
Necessary and Sufficient Condition to Assess Initial-State-Opacity in Live Bounded and Reversible Discrete Event Systems.
IEEE Control. Syst. Lett., 2022
2021
IEEE Trans. Autom. Control., 2021
Networks, 2021
A MILP Formulation for an Automated Guided Vehicle Scheduling Problem with Battery Constraints.
Proceedings of the Advances in Production Management Systems. Artificial Intelligence for Sustainable and Resilient Production Systems, 2021
Integer Linear Programming for optimizing the position of IEDs in Medium Voltage smart grids.
Proceedings of the IEEE International Instrumentation and Measurement Technology Conference, 2021
2020
IEEE Trans. Netw. Serv. Manag., 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
A Location-Routing Based Solution Approach for Reorganizing Postal Collection Operations in Rural Areas.
Proceedings of the Machine Learning, Optimization, and Data Science, 2020
2019
The Minimum Routing Cost Tree Problem - State of the art and a core-node based heuristic algorithm.
Soft Comput., 2019
Special issue on: Optimization methods for decision making: advances and applications.
Soft Comput., 2019
A three-stage p-median based exact method for the optimal diversity management problem.
Networks, 2019
2018
Multi-commodity location-routing: Flow intercepting formulation and branch-and-cut algorithm.
Comput. Oper. Res., 2018
Proceedings of the 23rd IEEE International Conference on Emerging Technologies and Factory Automation, 2018
Proceedings of the 57th IEEE Conference on Decision and Control, 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 23rd Mediterranean Conference on Control and Automation, 2015
Proceedings of the IEEE International Conference on Communication, 2015
Proceedings of the 2015 IEEE Conference on Control Applications, 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
A parallel subgradient algorithm for Lagrangean dual function of the p-median problem.
Stud. Inform. Univ., 2011
4OR, 2011
2010
Proceedings of the Experimental Algorithms, 9th International Symposium, 2010
2009
Location-Routing models and methods for Freight Distribution and Infomobility in City Logistics.
PhD thesis, 2009
J. Math. Model. Algorithms, 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