An Approach to Aid Decision-Making by Solving Complex Optimization Problems Using SQL Queries
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 we...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2022-04-01
|
| Series: | Applied Sciences |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2076-3417/12/9/4569 |
| _version_ | 1797505581312901120 |
|---|---|
| author | Jose Torres-Jimenez Nelson Rangel-Valdez Miguel De-la-Torre Himer Avila-George |
| author_facet | Jose Torres-Jimenez Nelson Rangel-Valdez Miguel De-la-Torre Himer Avila-George |
| author_sort | Jose Torres-Jimenez |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-03-10T04:20:39Z |
| format | Article |
| id | doaj.art-24b721cd913644309af6adff3bd81ff8 |
| institution | Directory Open Access Journal |
| issn | 2076-3417 |
| language | English |
| last_indexed | 2024-03-10T04:20:39Z |
| publishDate | 2022-04-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Applied Sciences |
| spelling | doaj.art-24b721cd913644309af6adff3bd81ff82023-11-23T07:50:51ZengMDPI AGApplied Sciences2076-34172022-04-01129456910.3390/app12094569An Approach to Aid Decision-Making by Solving Complex Optimization Problems Using SQL QueriesJose Torres-Jimenez0Nelson Rangel-Valdez1Miguel De-la-Torre2Himer Avila-George3CINVESTAV-Tamaulipas, Ciudad Victoria 87130, Tamaulipas, MexicoDivisión de Estudios de Posgrado e Investigación, Cátedras CONACyT—Tecnológico Nacional de México, Instituto Tecnológico de Ciudad Madero, Madero 89440, Tamaulipas, MexicoDepartamento de Ciencias Computacionales e Ingenierías, Universidad de Guadalajara, Guadalajara 46600, Jalisco, MexicoDepartamento de Ciencias Computacionales e Ingenierías, Universidad de Guadalajara, Guadalajara 46600, Jalisco, MexicoIn 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.https://www.mdpi.com/2076-3417/12/9/4569decision support systemcombinatorial optimizationThree-Coloring Graph ProblemPortfolio Selection ProblemMaximum Clique ProblemSQL queries |
| spellingShingle | Jose Torres-Jimenez Nelson Rangel-Valdez Miguel De-la-Torre Himer Avila-George An Approach to Aid Decision-Making by Solving Complex Optimization Problems Using SQL Queries Applied Sciences decision support system combinatorial optimization Three-Coloring Graph Problem Portfolio Selection Problem Maximum Clique Problem SQL queries |
| title | An Approach to Aid Decision-Making by Solving Complex Optimization Problems Using SQL Queries |
| title_full | An Approach to Aid Decision-Making by Solving Complex Optimization Problems Using SQL Queries |
| title_fullStr | An Approach to Aid Decision-Making by Solving Complex Optimization Problems Using SQL Queries |
| title_full_unstemmed | An Approach to Aid Decision-Making by Solving Complex Optimization Problems Using SQL Queries |
| title_short | An Approach to Aid Decision-Making by Solving Complex Optimization Problems Using SQL Queries |
| title_sort | approach to aid decision making by solving complex optimization problems using sql queries |
| topic | decision support system combinatorial optimization Three-Coloring Graph Problem Portfolio Selection Problem Maximum Clique Problem SQL queries |
| url | https://www.mdpi.com/2076-3417/12/9/4569 |
| work_keys_str_mv | AT josetorresjimenez anapproachtoaiddecisionmakingbysolvingcomplexoptimizationproblemsusingsqlqueries AT nelsonrangelvaldez anapproachtoaiddecisionmakingbysolvingcomplexoptimizationproblemsusingsqlqueries AT migueldelatorre anapproachtoaiddecisionmakingbysolvingcomplexoptimizationproblemsusingsqlqueries AT himeravilageorge anapproachtoaiddecisionmakingbysolvingcomplexoptimizationproblemsusingsqlqueries AT josetorresjimenez approachtoaiddecisionmakingbysolvingcomplexoptimizationproblemsusingsqlqueries AT nelsonrangelvaldez approachtoaiddecisionmakingbysolvingcomplexoptimizationproblemsusingsqlqueries AT migueldelatorre approachtoaiddecisionmakingbysolvingcomplexoptimizationproblemsusingsqlqueries AT himeravilageorge approachtoaiddecisionmakingbysolvingcomplexoptimizationproblemsusingsqlqueries |