skip to main content
Idioma:

An Approach to Aid Decision-Making by Solving Complex Optimization Problems Using SQL Queries

Torres-Jimenez, Jose ; Rangel-Valdez, Nelson ; De-la-Torre, Miguel ; Avila-George, Himer

Applied sciences, 2022-05, Vol.12 (9), p.4569 [Periódico revisado por pares]

Basel: MDPI AG

Texto completo disponível

Citações Citado por
  • Título:
    An Approach to Aid Decision-Making by Solving Complex Optimization Problems Using SQL Queries
  • Autor: Torres-Jimenez, Jose ; Rangel-Valdez, Nelson ; De-la-Torre, Miguel ; Avila-George, Himer
  • Assuntos: Combinatorial analysis ; combinatorial optimization ; Context ; Decision making ; decision support system ; Graph coloring ; Investments ; Maximum Clique Problem ; Optimization ; Portfolio Selection Problem ; Queries ; Query languages ; SQL queries ; Stock exchanges ; Structured Query Language-SQL ; Three-Coloring Graph Problem
  • É parte de: Applied sciences, 2022-05, Vol.12 (9), p.4569
  • Descrição: In combinatorial optimization, the more complex a problem is, the more challenging it becomes, usually causing most research to focus on creating solvers for larger cases. However, real-life situations also contain small-sized instances that deserve a researcher’s attention. For example, within a web development context, a developer might face small combinatorial optimization cases that fall in the following situations to solve them: (1) the development of an ad hoc specialized strategy is not justified; (2) the developer could lack the time, or skills, to create the solution; (3) the efficiency of naive brute force strategies might be compromised due to the programming paradigm use. Similar situations in this context, combined with a recent increasing interest in optimization information from databases, open a research area to develop easy-to-implement strategies that compete with those naive approaches and do not require specialized knowledge. Therefore, this work revises Structured Query Language (SQL) approaches and proposes new methods to tackle combinatorial optimization problems such as the Portfolio Selection Problem, Maximum Clique Problem, and Graph Coloring Problem. The performance of the resulting queries is compared against naive approaches; its potential to extend to other optimization problems is studied. The presented examples demonstrate the simplicity and versatility of using a SQL approach to solve small optimization problem instances.
  • Editor: Basel: MDPI AG
  • Idioma: Inglês
Voltar para lista de resultados

  • Realização: ABCD-USP USP   Logos de Redes Sociais: Freepik

Buscando em bases de dados remotas. Favor aguardar.