Zobrazeno 1 - 10
of 53
pro vyhledávání: '"Haroldo Gambini Santos"'
Autor:
Vitor Nazário Coelho, Rodolfo Pereira Araújo, Haroldo Gambini Santos, Wang Yong Qiang, Igor Machado Coelho
Publikováno v:
Future Internet, Vol 12, Iss 11, p 185 (2020)
Mixed-integer mathematical programming has been widely used to model and solve challenging optimization problems. One interesting feature of this technique is the ability to prove the optimality of the achieved solution, for many practical scenarios
Externí odkaz:
https://doaj.org/article/d074447dc0cd494183ddaac702d1c19c
Publikováno v:
Operations Research Letters. 49:844-850
The knapsack problem with conflicting items arises in several real-world applications. We propose a family of strong cutting planes and prove that a subfamily of these cuts can be facet-defining. Computational experiments show that the proposed cuts
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3c83917208152cfbd6d98aacdb6e004c
https://doi.org/10.1016/j.orl.2021.10.001
https://doi.org/10.1016/j.orl.2021.10.001
Autor:
Luiz Henrique de Campos Merschmann, Greet Van den Berghe, Haroldo Gambini Santos, Matheus Guedes Vilas Boas
Publikováno v:
International Transactions in Operational Research. 28:2759-2781
Even though it is well known that for most relevant computational problems different algorithms may perform better on different classes of problem instances, most researchers still focus on determining a single best algorithmic configuration based on
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8e186debac46a790be2902202f1e686b
https://doi.org/10.1111/itor.12724
https://doi.org/10.1111/itor.12724
Publikováno v:
Pesquisa Operacional para o Desenvolvimento. 11:127-138
O pacote Python-MIP oferece um conjunto abrangente de ferramentas para modelagem e resolucao de Problemas de Programacao Inteira Mista em Python. Alem de oferecer uma linguagem de modelagem de alto nivel, o pacote permite o desenvolvimento de metodos
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5acf9e0c3688d4a2cddb11ce7c58910a
https://doi.org/10.4322/podes.2019.009
https://doi.org/10.4322/podes.2019.009
Autor:
Angelo Sifaleras, Vitor Nazário Coelho, Igor Machado Coelho, Marcone Jamilson Freitas Souza, Thays A. Oliveira, Haroldo Gambini Santos, Puca Huachi Vaz Penna
Publikováno v:
Electronic Notes in Discrete Mathematics. 66:1-5
In this issue we present a peer-reviewed selection of short papers that were accepted for presentation in the 4th International Conference on Variable Neighborhood Search (ICVNS'16) which was held in Malaga, Spain, during October 3–5, 2016. This co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::de3f9cd4c475085562c89d29037fc4f7
https://doi.org/10.1016/j.endm.2018.03.001
https://doi.org/10.1016/j.endm.2018.03.001
Autor:
Vitor Nazário Coelho, Haroldo Gambini Santos, Bruno Nazário Coelho, Alexandre C. Barbosa, Frederico Gadelha Guimarães, Luis Satoru Ochi, Igor Machado Coelho, Leo Pereira, Glauber C. de Oliveira, Alan Robert Resende de Freitas
Publikováno v:
Applied Energy. 201:371-381
In this paper (a substantial extension of the short version presented at REM2016 on April 19–21, Maldives [1]), multi-objective power dispatching is discussed in the scope of microgrids located in smart cities. The proposed system considers the use
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0f1ff34cc70bdf0b08907f224a4f9afd
https://doi.org/10.1016/j.apenergy.2016.12.043
https://doi.org/10.1016/j.apenergy.2016.12.043
Publikováno v:
Operations Research Letters. 45:206-209
Pecin etal. (2016) introduced a limited memory technique that allows an efficient use of Rank-1 cuts in the Set Partitioning Formulation of Vehicle Routing Problems, motivating a deeper investigation of those cuts. This work presents a computational
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5577c5ac2a748255dfe6884ce1a99697
https://doi.org/10.1016/j.orl.2017.02.006
https://doi.org/10.1016/j.orl.2017.02.006
Publikováno v:
Electronic Notes in Discrete Mathematics. 58:7-14
Chvatal-Gomory cuts are well-known cutting planes for Integer Programming problems. As shown in previous works, the inclusion of these cuts allows to significantly reducing the integrality gap. This work presents a Local Search heuristic approach bas
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::602a994d218e2f1651966151632d6ac2
https://doi.org/10.1016/j.endm.2017.03.002
https://doi.org/10.1016/j.endm.2017.03.002
Publikováno v:
Electronic Notes in Discrete Mathematics. 58:207-214
In the Graph Drawing problem a set of symbols must be placed in a plane and their connections routed. To produce clear, easy to read diagrams, this problem is usually solved trying to minimize edges crossing and the area occupied, resulting in a NP-H
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3211fdc69d48dfed1476cba08b33e4aa
https://doi.org/10.1016/j.endm.2017.03.027
https://doi.org/10.1016/j.endm.2017.03.027
Autor:
Haroldo Gambini Santos, Luiz Henrique de Campos Merschmann, Rafael Martins, Matheus Guedes Vilas Boas
Publikováno v:
ICCS
Integer Programming (IP) is the most successful technique for solving hard combinatorial optimization problems. Modern IP solvers are very complex programs composed of many different procedures whose execution is embedded in the generic Branch & Boun
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6000ac861938c2f1ce54d96efba99632
https://doi.org/10.1016/j.procs.2017.05.286
https://doi.org/10.1016/j.procs.2017.05.286