Carlos Gomes da Silva
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Carlos Gomes da Silva has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- João Clímaco
INESC Coimbra
8 shared publications - José Rui Figueira
CEGIST, Instituto Superior Técnico, Universidade de Lisboa, Lisbon, Portugal
6 shared publications - Pedro Carreira
Department of Management and Economics, School of Technology and Management, Polytechnic Institute of Leiria, Leiria, Portugal
3 shared publications - Adiel Teixeira de Almeida Filho
Universidade Federal de Pernambuco
1 shared publication Jo ̃Ao C. N. Cl ́Imaco
1 shared publication- José Craveirinha
University of Coimbra
1 shared publication
Latest Publications
- Open Access
- 13 March 2026
- Published by Springer Nature in Circular Economy and Sustainability
- Vol. 6 (2)
Sustainable Location of Reverse Vending Machines
Reverse Vending Machines (RVMs) may play a fundamental role in a circular economy, ensuring materials circulate and maintain their greatest utility and value for as long as possible. Location is key to their success and aligning it with regional sustainable development adds complexity to the decision. In this paper we link sustainability with the location of RVMs to reveal, through mathematical models, the inherent trade-offs involved in simultaneously managing the three pillars of sustainability—social, economic, and environmental—when locating RVMs. Spatial interaction behaviours are employed to represent the demand for RVMs, with multiple allocation incorporated into the proposed models. Instead of relying on the common assumption of known and constant demand, we develop a demand function that accounts for both the attractiveness of RVMs and their distances to users. This approach provides a more accurate representation of effective demand patterns, thereby adding a novel contribution to literature. Additionally, real-world data from specific territory is used to illustrate the policy, managerial and operational challenges involved in determining the location of RVMs. The results obtained pinpoint the compromising locations for RVMs aiming the three pillars of sustainability, delivering to the decision makers the balance between them, as well as the impacts of the underlying political options on the location decision. Finally, a sensitivity analysis of the parameters used is performed to assess the robustness of the solutions found.
- 13 March 2026
- Published by Springer Nature in Circular Economy and Sustainability
- Vol. 6 (2)
Open AccessSustainable Location of Reverse Vending Machines
Reverse Vending Machines (RVMs) may play a fundamental role in a circular economy, ensuring materials circulate and maintain their greatest utility and value for as long as possible. Location is key to their success and aligning it with regional sustainable development adds complexity to the decision. In this paper we link sustainability with the location of RVMs to reveal, through mathematical models, the inherent trade-offs involved in simultaneously managing the three pillars of sustainability—social, economic, and environmental—when locating RVMs. Spatial interaction behaviours are employed to represent the demand for RVMs, with multiple allocation incorporated into the proposed models. Instead of relying on the common assumption of known and constant demand, we develop a demand function that accounts for both the attractiveness of RVMs and their distances to users. This approach provides a more accurate representation of effective demand patterns, thereby adding a novel contribution to literature. Additionally, real-world data from specific territory is used to illustrate the policy, managerial and operational challenges involved in determining the location of RVMs. The results obtained pinpoint the compromising locations for RVMs aiming the three pillars of sustainability, delivering to the decision makers the balance between them, as well as the impacts of the underlying political options on the location decision. Finally, a sensitivity analysis of the parameters used is performed to assess the robustness of the solutions found.
- 3 October 2016
- Published by Emerald Publishing in Journal of Financial Crime
- Vol. 23 (4) , 798-805
Assessing the omission of records from a data set using Benford’s law
Purpose: The purpose of this paper is to propose a methodology to estimate the number of records that were omitted from a data set, and to assess its effectiveness. Design/methodology/approach: The procedure to estimate the number of records that were omitted from a data set is based on Benford’s law. Empirical experiments are performed to illustrate the application of the procedure. In detail, two simulated Benford-conforming data sets are distorted and the procedure is then used to recover the original patterns of the data sets. Findings: The effectiveness of the procedure seems to increase with the degree of conformity of the original data set with Benford’s law. Practical implications: This work can be useful in auditing and economic crime detection, namely in identifying tax evasion. Originality/value: This work is the first to propose Benford’s law as a tool to detect data evasion.
- 3 October 2016
- Published by Emerald Publishing in Journal of Financial Crime
- Vol. 23 (4) , 798-805
Assessing the omission of records from a data set using Benford’s law
Purpose: The purpose of this paper is to propose a methodology to estimate the number of records that were omitted from a data set, and to assess its effectiveness. Design/methodology/approach: The procedure to estimate the number of records that were omitted from a data set is based on Benford’s law. Empirical experiments are performed to illustrate the application of the procedure. In detail, two simulated Benford-conforming data sets are distorted and the procedure is then used to recover the original patterns of the data sets. Findings: The effectiveness of the procedure seems to increase with the degree of conformity of the original data set with Benford’s law. Practical implications: This work can be useful in auditing and economic crime detection, namely in identifying tax evasion. Originality/value: This work is the first to propose Benford’s law as a tool to detect data evasion.
- 1 June 2015
- Published by World Scientific Pub Co Pte Ltd in International Journal of Financial Engineering
- Vol. 02 (02)
Modeling intraday information in financial markets with the scatter search metaheuristic
Intraday information about stocks or financial indexes is important for the definition of investors' strategies. In this paper two problems where the intraday information is used are studied: (i) modeling a bandwidth for the range of daily maximum and daily prices/values; (ii) modeling an upper and a lower bounds for the daily maximum and daily prices/values. A non-linear transformation of a modified AR(p) process is used, with the parameters computed by the scatter search metaheuristic. The approach is tested with historical data from NASDAQ, DAX, CAC40 and S&P financial series.
- 1 June 2015
- Published by World Scientific Pub Co Pte Ltd in International Journal of Financial Engineering
- Vol. 02 (02)
Modeling intraday information in financial markets with the scatter search metaheuristic
Intraday information about stocks or financial indexes is important for the definition of investors' strategies. In this paper two problems where the intraday information is used are studied: (i) modeling a bandwidth for the range of daily maximum and daily prices/values; (ii) modeling an upper and a lower bounds for the daily maximum and daily prices/values. A non-linear transformation of a modified AR(p) process is used, with the parameters computed by the scatter search metaheuristic. The approach is tested with historical data from NASDAQ, DAX, CAC40 and S&P financial series.
- 1 January 2013
- Published by World Scientific Pub Co Pte Ltd in International Journal of Information Technology & Decision Making
- Vol. 12 (01) , 27-44
USING WEIGHTED-SUM FUNCTIONS TO COMPUTE NONSUPPORTED EFFICIENT SOLUTIONS IN MULTIOBJECTIVE COMBINATORIAL-{0,1} PROBLEMS
In multiobjective linear programming, the weighted-sum functions can be used to characterize the entire set of efficient solutions, but in multiobjective combinatorial-{0,1} problems these functions can only determine a small subset of efficient solutions, called supported efficient solutions. In this paper, we show how the entire set of efficient solutions can be found with the same technique by modifying the original problem. An algorithm is proposed. Some results are presented and the effect of some parameters of the proposed algorithm is illustrated with the multiobjective {0,1}-knapsack problem.
- 1 January 2013
- Published by World Scientific Pub Co Pte Ltd in International Journal of Information Technology & Decision Making
- Vol. 12 (01) , 27-44
USING WEIGHTED-SUM FUNCTIONS TO COMPUTE NONSUPPORTED EFFICIENT SOLUTIONS IN MULTIOBJECTIVE COMBINATORIAL-{0,1} PROBLEMS
In multiobjective linear programming, the weighted-sum functions can be used to characterize the entire set of efficient solutions, but in multiobjective combinatorial-{0,1} problems these functions can only determine a small subset of efficient solutions, called supported efficient solutions. In this paper, we show how the entire set of efficient solutions can be found with the same technique by modifying the original problem. An algorithm is proposed. Some results are presented and the effect of some parameters of the proposed algorithm is illustrated with the multiobjective {0,1}-knapsack problem.
- 1 October 2012
- Published by American Accounting Association in AUDITING: A Journal of Practice & Theory
- Vol. 32 (2) , 53-65
Selecting Audit Samples Using Benford's Law
SUMMARY: We contribute to digital analysis by developing two mathematical programming models that can assist auditors in selecting more promising audit samples, using Benford's law. One model identifies the smallest subset of nonconforming records in a dataset, given some predefined conformity criteria, and the other highlights the k most nonconforming records. The models take into account several conformity tests and test statistics simultaneously. The application of the models is illustrated using suggested protocols on a set of simulated data. Finally, the effectiveness of the models in detecting typical data manipulations is assessed under different contamination levels.
- 1 October 2012
- Published by American Accounting Association in AUDITING: A Journal of Practice & Theory
- Vol. 32 (2) , 53-65
Selecting Audit Samples Using Benford's Law
SUMMARY: We contribute to digital analysis by developing two mathematical programming models that can assist auditors in selecting more promising audit samples, using Benford's law. One model identifies the smallest subset of nonconforming records in a dataset, given some predefined conformity criteria, and the other highlights the k most nonconforming records. The models take into account several conformity tests and test statistics simultaneously. The application of the models is illustrated using suggested protocols on a set of simulated data. Finally, the effectiveness of the models in detecting typical data manipulations is assessed under different contamination levels.
- 30 July 2011
- Published by Springer Nature in Telecommunication Systems
- Vol. 52 (1) , 203-215
A bi-criteria minimum spanning tree routing model for MPLS/overlay networks
- 30 July 2011
- Published by Springer Nature in Telecommunication Systems
- Vol. 52 (1) , 203-215
A bi-criteria minimum spanning tree routing model for MPLS/overlay networks
- 15 October 2009
- Published by Springer Nature in 4OR
- Vol. 8 (2) , 195-211
The small world of efficient solutions: empirical evidence from the bi-objective {0,1}-knapsack problem
- 15 October 2009
- Published by Springer Nature in 4OR
- Vol. 8 (2) , 195-211
The small world of efficient solutions: empirical evidence from the bi-objective {0,1}-knapsack problem
- 1 August 2008
- Published by Elsevier in Information Sciences
- Vol. 178 (16) , 3288-3299
Time series forecasting with a non-linear model and the scatter search meta-heuristic
- 1 August 2008
- Published by Elsevier in Information Sciences
- Vol. 178 (16) , 3288-3299
Time series forecasting with a non-linear model and the scatter search meta-heuristic
- 31 July 2008
- Published by Elsevier in Computers & Operations Research
- Vol. 35 (7) , 2292-2306
Core problems in bi-criteria {0,1}-knapsack problems
- 31 July 2008
- Published by Elsevier in Computers & Operations Research
- Vol. 35 (7) , 2292-2306
Core problems in bi-criteria {0,1}-knapsack problems