Conflict graphs in mixed-integer linear programming : preprocessing, heuristics and cutting planes.

Detalhes bibliográficos
Autor(a) principal: Brito, Samuel Souza
Data de Publicação: 2020
Tipo de documento: Tese
Idioma: eng
Título da fonte: Repositório Institucional da UFOP
Texto Completo: http://www.repositorio.ufop.br/handle/123456789/12386
Resumo: Programa de Pós-Graduação em Ciência da Computação. Departamento de Ciência da Computação, Instituto de Ciências Exatas e Biológicas, Universidade Federal de Ouro Preto.
id UFOP_cd1a8d6d5e4797e52384c0daf6679cea
oai_identifier_str oai:localhost:123456789/12386
network_acronym_str UFOP
network_name_str Repositório Institucional da UFOP
repository_id_str 3233
spelling Brito, Samuel SouzaSantos, Haroldo GambiniFonseca, George Henrique Godim daMateus, Geraldo RobsonAragão, Marcus Vinicius Soledade Poggi deToffolo, Túlio Ângelo MachadoSantos, Haroldo Gambini2020-06-25T15:30:25Z2020-06-25T15:30:25Z2020BRITO, Samuel Souza. Conflict graphs in mixed-integer linear programming: preprocessing, heuristics and cutting planes. 110 f. 2020. Tese (Doutorado em Ciência da Computação) - Instituto de Ciências Exatas e Biológicas, Universidade Federal de Ouro Preto, Ouro Preto, 2020.http://www.repositorio.ufop.br/handle/123456789/12386Programa de Pós-Graduação em Ciência da Computação. Departamento de Ciência da Computação, Instituto de Ciências Exatas e Biológicas, Universidade Federal de Ouro Preto.This thesis addresses the development of con ict graph-based algorithms for MixedInteger Linear Programming, including: (i) an e cient infrastructure for the construction and manipulation of con ict graphs; (ii) a preprocessing routine based on a clique strengthening scheme that can both reduce the number of constraints and produce stronger formulations; (iii) a clique cut separator capable of obtaining dual bounds at the root node LP relaxation that are 19.65% stronger than those provided by the equivalent cut generator of a state-of-the-art commercial solver, 3.62 times better than those attained by the clique cut separator of the GLPK solver and 4.22 times stronger than the dual bounds obtained by the clique separation routine of the COIN-OR Cut Generation Library; (iv) an odd-cycle cut separator with a new lifting module to produce valid odd-wheel inequalities; (v) two diving heuristics capable of generating integer feasible solutions in restricted execution times. Additionally, we generated a new version of the COIN-OR Branch-and-Cut (CBC) solver by including our con ict graph infrastructure, preprocessing routine and cut separators. The average gap closed by this new version of CBC was up to four times better than its previous version. Moreover, the number of mixed-integer programs solved by CBC in a time limit of three hours was increased by 23.53%.An error occurred getting the license - uri.Autorização concedida ao Repositório Institucional da UFOP pelo(a) autor(a) em 17/06/2020 com as seguintes condições: disponível sob Licença Creative Commons 4.0 que permite copiar, distribuir e transmitir o trabalho desde que sejam citados o autor e o licenciante. Não permite o uso para fins comerciais.info:eu-repo/semantics/openAccessProgramação linearHeurísticaProgramação - computadores - processamentoProgramação heurísticaConflict graphs in mixed-integer linear programming : preprocessing, heuristics and cutting planes.info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/doctoralThesisengreponame:Repositório Institucional da UFOPinstname:Universidade Federal de Ouro Preto (UFOP)instacron:UFOPLICENSElicense.txtlicense.txttext/plain; charset=utf-8924http://www.repositorio.ufop.br/bitstream/123456789/12386/8/license.txt62604f8d955274beb56c80ce1ee5dcaeMD58CC-LICENSElicense_rdflicense_rdfapplication/rdf+xml; charset=utf-89http://www.repositorio.ufop.br/bitstream/123456789/12386/7/license_rdf42dd12a06de379d3ffa39b67dc9c7affMD57ORIGINALTESE_ConflictGraphsMixed.pdfTESE_ConflictGraphsMixed.pdfapplication/pdf1276340http://www.repositorio.ufop.br/bitstream/123456789/12386/6/TESE_ConflictGraphsMixed.pdf18e0f237c356e153f7c06efc925d474eMD56123456789/123862020-06-25 11:34:27.929oai:localhost:123456789/12386RGVjbGFyYcOnw6NvIGRlIGRpc3RyaWJ1acOnw6NvIG7Do28tZXhjbHVzaXZhCgpPIHJlZmVyaWRvIGF1dG9yOgoKYSlEZWNsYXJhIHF1ZSBvIGRvY3VtZW50byBlbnRyZWd1ZSDDqSBzZXUgdHJhYmFsaG8gb3JpZ2luYWwgZSBxdWUgZGV0w6ltIG8gZGlyZWl0byBkZSBjb25jZWRlciBvcyBkaXJlaXRvcyBjb250aWRvcyBuZXN0YSBsaWNlbsOnYS4gRGVjbGFyYSB0YW1iw6ltIHF1ZSBhIGVudHJlZ2EgZG8gZG9jdW1lbnRvIG7Do28gaW5mcmluZ2UsIHRhbnRvIHF1YW50byBsaGUgw6kgcG9zc8OtdmVsIHNhYmVyLCBvcyBkaXJlaXRvcyBkZSBxdWFscXVlciBwZXNzb2Egb3UgZW50aWRhZGUuCgpiKVNlIG8gZG9jdW1lbnRvIGVudHJlZ3VlIGNvbnTDqW0gbWF0ZXJpYWwgZG8gcXVhbCBuw6NvIGRldMOpbSBvcyBkaXJlaXRvcyBkZSBhdXRvciwgZGVjbGFyYSBxdWUgb2J0ZXZlIGF1dG9yaXphw6fDo28gZG8gZGV0ZW50b3IgZG9zIGRpcmVpdG9zIGRlIGF1dG9yIHBhcmEgY29uY2VkZXIgw6AgVW5pdmVyc2lkYWRlIEZlZGVyYWwgZGUgT3VybyBQcmV0by9VRk9QIG9zIGRpcmVpdG9zIHJlcXVlcmlkb3MgcG9yIGVzdGEgbGljZW7Dp2EgZSBxdWUgZXNzZSBtYXRlcmlhbCwgY3Vqb3MgZGlyZWl0b3Mgc8OjbyBkZSB0ZXJjZWlyb3MsIGVzdMOhIGNsYXJhbWVudGUgaWRlbnRpZmljYWRvIGUgcmVjb25oZWNpZG8gbm8gdGV4dG8gb3UgY29udGXDumRvcyBkbyBkb2N1bWVudG8gZW50cmVndWUuCgpjKVNlIG8gZG9jdW1lbnRvIGVudHJlZ3VlIMOpIGJhc2VhZG8gZW0gdHJhYmFsaG8gZmluYW5jaWFkbyBvdSBhcG9pYWRvIHBvciBvdXRyYSBpbnN0aXR1acOnw6NvIHF1ZSBuw6NvIGEgVUZPUCwgZGVjbGFyYSBxdWUgY3VtcHJpdSBxdWFpc3F1ZXIgb2JyaWdhw6fDtWVzIGV4aWdpZGFzIHBlbG8gY29udHJhdG8gb3UgYWNvcmRvLgoKRepositório InstitucionalPUBhttp://www.repositorio.ufop.br/oai/requestrepositorio@ufop.edu.bropendoar:32332020-06-25T15:34:27Repositório Institucional da UFOP - Universidade Federal de Ouro Preto (UFOP)false
dc.title.pt_BR.fl_str_mv Conflict graphs in mixed-integer linear programming : preprocessing, heuristics and cutting planes.
title Conflict graphs in mixed-integer linear programming : preprocessing, heuristics and cutting planes.
spellingShingle Conflict graphs in mixed-integer linear programming : preprocessing, heuristics and cutting planes.
Brito, Samuel Souza
Programação linear
Heurística
Programação - computadores - processamento
Programação heurística
title_short Conflict graphs in mixed-integer linear programming : preprocessing, heuristics and cutting planes.
title_full Conflict graphs in mixed-integer linear programming : preprocessing, heuristics and cutting planes.
title_fullStr Conflict graphs in mixed-integer linear programming : preprocessing, heuristics and cutting planes.
title_full_unstemmed Conflict graphs in mixed-integer linear programming : preprocessing, heuristics and cutting planes.
title_sort Conflict graphs in mixed-integer linear programming : preprocessing, heuristics and cutting planes.
author Brito, Samuel Souza
author_facet Brito, Samuel Souza
author_role author
dc.contributor.referee.pt_BR.fl_str_mv Santos, Haroldo Gambini
Fonseca, George Henrique Godim da
Mateus, Geraldo Robson
Aragão, Marcus Vinicius Soledade Poggi de
Toffolo, Túlio Ângelo Machado
dc.contributor.author.fl_str_mv Brito, Samuel Souza
dc.contributor.advisor1.fl_str_mv Santos, Haroldo Gambini
contributor_str_mv Santos, Haroldo Gambini
dc.subject.por.fl_str_mv Programação linear
Heurística
Programação - computadores - processamento
Programação heurística
topic Programação linear
Heurística
Programação - computadores - processamento
Programação heurística
description Programa de Pós-Graduação em Ciência da Computação. Departamento de Ciência da Computação, Instituto de Ciências Exatas e Biológicas, Universidade Federal de Ouro Preto.
publishDate 2020
dc.date.accessioned.fl_str_mv 2020-06-25T15:30:25Z
dc.date.available.fl_str_mv 2020-06-25T15:30:25Z
dc.date.issued.fl_str_mv 2020
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/doctoralThesis
format doctoralThesis
status_str publishedVersion
dc.identifier.citation.fl_str_mv BRITO, Samuel Souza. Conflict graphs in mixed-integer linear programming: preprocessing, heuristics and cutting planes. 110 f. 2020. Tese (Doutorado em Ciência da Computação) - Instituto de Ciências Exatas e Biológicas, Universidade Federal de Ouro Preto, Ouro Preto, 2020.
dc.identifier.uri.fl_str_mv http://www.repositorio.ufop.br/handle/123456789/12386
identifier_str_mv BRITO, Samuel Souza. Conflict graphs in mixed-integer linear programming: preprocessing, heuristics and cutting planes. 110 f. 2020. Tese (Doutorado em Ciência da Computação) - Instituto de Ciências Exatas e Biológicas, Universidade Federal de Ouro Preto, Ouro Preto, 2020.
url http://www.repositorio.ufop.br/handle/123456789/12386
dc.language.iso.fl_str_mv eng
language eng
dc.rights.driver.fl_str_mv An error occurred getting the license - uri.
info:eu-repo/semantics/openAccess
rights_invalid_str_mv An error occurred getting the license - uri.
eu_rights_str_mv openAccess
dc.source.none.fl_str_mv reponame:Repositório Institucional da UFOP
instname:Universidade Federal de Ouro Preto (UFOP)
instacron:UFOP
instname_str Universidade Federal de Ouro Preto (UFOP)
instacron_str UFOP
institution UFOP
reponame_str Repositório Institucional da UFOP
collection Repositório Institucional da UFOP
bitstream.url.fl_str_mv http://www.repositorio.ufop.br/bitstream/123456789/12386/8/license.txt
http://www.repositorio.ufop.br/bitstream/123456789/12386/7/license_rdf
http://www.repositorio.ufop.br/bitstream/123456789/12386/6/TESE_ConflictGraphsMixed.pdf
bitstream.checksum.fl_str_mv 62604f8d955274beb56c80ce1ee5dcae
42dd12a06de379d3ffa39b67dc9c7aff
18e0f237c356e153f7c06efc925d474e
bitstream.checksumAlgorithm.fl_str_mv MD5
MD5
MD5
repository.name.fl_str_mv Repositório Institucional da UFOP - Universidade Federal de Ouro Preto (UFOP)
repository.mail.fl_str_mv repositorio@ufop.edu.br
_version_ 1801685728914046976

Registros relacionados