A computational study of conflict graphs and aggressive cut separation in integer programming.

Detalhes bibliográficos
Autor(a) principal: Brito, Samuel Souza
Data de Publicação: 2015
Outros Autores: Santos, Haroldo Gambini
Tipo de documento: Artigo
Idioma: eng
Título da fonte: Repositório Institucional da UFOP
Texto Completo: http://www.repositorio.ufop.br/handle/123456789/6973
https://doi.org/10.1016/j.endm.2015.07.059
Resumo: This work explores the fast creation of densely populated conflict graphs at the root node of the search tree for integer programs. We show that not only the Generalized Upper Bound (GUB) constraints are useful for the fast detection of cliques: these can also be quickly detected in less structured constraints in O(n log n). Routines for the aggressive separation and lifting of cliques and odd-holes are proposed. Improved bounds and a faster convergence to strong bounds were observed when comparing to the default separation routines found in the current version of the COmputation INfrastructure for Operations Research (COIN-OR) Branch and Cut solver.
id UFOP_c09107bc27bfb269e75034b72dd489ca
oai_identifier_str oai:localhost:123456789/6973
network_acronym_str UFOP
network_name_str Repositório Institucional da UFOP
repository_id_str 3233
spelling Brito, Samuel SouzaSantos, Haroldo Gambini2016-09-05T20:06:41Z2016-09-05T20:06:41Z2015BRITO, S. S.; SANTOS, H. G. A computational study of conflict graphs and aggressive cut separation in integer programming. Electronic Notes in Discrete Mathematics, v. 50, p. 355-360, 2015. Disponível em: <http://www.sciencedirect.com/science/article/pii/S1571065315002140>. Acesso em: 07 ago. 2016.1571-0653http://www.repositorio.ufop.br/handle/123456789/6973https://doi.org/10.1016/j.endm.2015.07.059This work explores the fast creation of densely populated conflict graphs at the root node of the search tree for integer programs. We show that not only the Generalized Upper Bound (GUB) constraints are useful for the fast detection of cliques: these can also be quickly detected in less structured constraints in O(n log n). Routines for the aggressive separation and lifting of cliques and odd-holes are proposed. Improved bounds and a faster convergence to strong bounds were observed when comparing to the default separation routines found in the current version of the COmputation INfrastructure for Operations Research (COIN-OR) Branch and Cut solver.O periódico Electronic Notes in Discrete Mathematics concede permissão para depósito deste artigo no Repositório Institucional da UFOP. Número da licença: 3926560831204.info:eu-repo/semantics/openAccessConflict graphsInteger programmingCutting planesCliquesOdd holesA computational study of conflict graphs and aggressive cut separation in integer programming.info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleengreponame: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/6973/2/license.txt62604f8d955274beb56c80ce1ee5dcaeMD52ORIGINALARTIGO_ComputacionalStudyConflit.pdfARTIGO_ComputacionalStudyConflit.pdfapplication/pdf203667http://www.repositorio.ufop.br/bitstream/123456789/6973/1/ARTIGO_ComputacionalStudyConflit.pdf2f57f74bb9cd42b44454de64a92b120cMD51123456789/69732019-10-14 10:22:09.338oai:localhost:123456789/6973RGVjbGFyYcOnw6NvIGRlIGRpc3RyaWJ1acOnw6NvIG7Do28tZXhjbHVzaXZhCgpPIHJlZmVyaWRvIGF1dG9yOgoKYSlEZWNsYXJhIHF1ZSBvIGRvY3VtZW50byBlbnRyZWd1ZSDDqSBzZXUgdHJhYmFsaG8gb3JpZ2luYWwgZSBxdWUgZGV0w6ltIG8gZGlyZWl0byBkZSBjb25jZWRlciBvcyBkaXJlaXRvcyBjb250aWRvcyBuZXN0YSBsaWNlbsOnYS4gRGVjbGFyYSB0YW1iw6ltIHF1ZSBhIGVudHJlZ2EgZG8gZG9jdW1lbnRvIG7Do28gaW5mcmluZ2UsIHRhbnRvIHF1YW50byBsaGUgw6kgcG9zc8OtdmVsIHNhYmVyLCBvcyBkaXJlaXRvcyBkZSBxdWFscXVlciBwZXNzb2Egb3UgZW50aWRhZGUuCgpiKVNlIG8gZG9jdW1lbnRvIGVudHJlZ3VlIGNvbnTDqW0gbWF0ZXJpYWwgZG8gcXVhbCBuw6NvIGRldMOpbSBvcyBkaXJlaXRvcyBkZSBhdXRvciwgZGVjbGFyYSBxdWUgb2J0ZXZlIGF1dG9yaXphw6fDo28gZG8gZGV0ZW50b3IgZG9zIGRpcmVpdG9zIGRlIGF1dG9yIHBhcmEgY29uY2VkZXIgw6AgVW5pdmVyc2lkYWRlIEZlZGVyYWwgZGUgT3VybyBQcmV0by9VRk9QIG9zIGRpcmVpdG9zIHJlcXVlcmlkb3MgcG9yIGVzdGEgbGljZW7Dp2EgZSBxdWUgZXNzZSBtYXRlcmlhbCwgY3Vqb3MgZGlyZWl0b3Mgc8OjbyBkZSB0ZXJjZWlyb3MsIGVzdMOhIGNsYXJhbWVudGUgaWRlbnRpZmljYWRvIGUgcmVjb25oZWNpZG8gbm8gdGV4dG8gb3UgY29udGXDumRvcyBkbyBkb2N1bWVudG8gZW50cmVndWUuCgpjKVNlIG8gZG9jdW1lbnRvIGVudHJlZ3VlIMOpIGJhc2VhZG8gZW0gdHJhYmFsaG8gZmluYW5jaWFkbyBvdSBhcG9pYWRvIHBvciBvdXRyYSBpbnN0aXR1acOnw6NvIHF1ZSBuw6NvIGEgVUZPUCwgZGVjbGFyYSBxdWUgY3VtcHJpdSBxdWFpc3F1ZXIgb2JyaWdhw6fDtWVzIGV4aWdpZGFzIHBlbG8gY29udHJhdG8gb3UgYWNvcmRvLgoKRepositório InstitucionalPUBhttp://www.repositorio.ufop.br/oai/requestrepositorio@ufop.edu.bropendoar:32332019-10-14T14:22:09Repositório Institucional da UFOP - Universidade Federal de Ouro Preto (UFOP)false
dc.title.pt_BR.fl_str_mv A computational study of conflict graphs and aggressive cut separation in integer programming.
title A computational study of conflict graphs and aggressive cut separation in integer programming.
spellingShingle A computational study of conflict graphs and aggressive cut separation in integer programming.
Brito, Samuel Souza
Conflict graphs
Integer programming
Cutting planes
Cliques
Odd holes
title_short A computational study of conflict graphs and aggressive cut separation in integer programming.
title_full A computational study of conflict graphs and aggressive cut separation in integer programming.
title_fullStr A computational study of conflict graphs and aggressive cut separation in integer programming.
title_full_unstemmed A computational study of conflict graphs and aggressive cut separation in integer programming.
title_sort A computational study of conflict graphs and aggressive cut separation in integer programming.
author Brito, Samuel Souza
author_facet Brito, Samuel Souza
Santos, Haroldo Gambini
author_role author
author2 Santos, Haroldo Gambini
author2_role author
dc.contributor.author.fl_str_mv Brito, Samuel Souza
Santos, Haroldo Gambini
dc.subject.por.fl_str_mv Conflict graphs
Integer programming
Cutting planes
Cliques
Odd holes
topic Conflict graphs
Integer programming
Cutting planes
Cliques
Odd holes
description This work explores the fast creation of densely populated conflict graphs at the root node of the search tree for integer programs. We show that not only the Generalized Upper Bound (GUB) constraints are useful for the fast detection of cliques: these can also be quickly detected in less structured constraints in O(n log n). Routines for the aggressive separation and lifting of cliques and odd-holes are proposed. Improved bounds and a faster convergence to strong bounds were observed when comparing to the default separation routines found in the current version of the COmputation INfrastructure for Operations Research (COIN-OR) Branch and Cut solver.
publishDate 2015
dc.date.issued.fl_str_mv 2015
dc.date.accessioned.fl_str_mv 2016-09-05T20:06:41Z
dc.date.available.fl_str_mv 2016-09-05T20:06:41Z
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
format article
status_str publishedVersion
dc.identifier.citation.fl_str_mv BRITO, S. S.; SANTOS, H. G. A computational study of conflict graphs and aggressive cut separation in integer programming. Electronic Notes in Discrete Mathematics, v. 50, p. 355-360, 2015. Disponível em: <http://www.sciencedirect.com/science/article/pii/S1571065315002140>. Acesso em: 07 ago. 2016.
dc.identifier.uri.fl_str_mv http://www.repositorio.ufop.br/handle/123456789/6973
dc.identifier.issn.none.fl_str_mv 1571-0653
dc.identifier.doi.none.fl_str_mv https://doi.org/10.1016/j.endm.2015.07.059
identifier_str_mv BRITO, S. S.; SANTOS, H. G. A computational study of conflict graphs and aggressive cut separation in integer programming. Electronic Notes in Discrete Mathematics, v. 50, p. 355-360, 2015. Disponível em: <http://www.sciencedirect.com/science/article/pii/S1571065315002140>. Acesso em: 07 ago. 2016.
1571-0653
url http://www.repositorio.ufop.br/handle/123456789/6973
https://doi.org/10.1016/j.endm.2015.07.059
dc.language.iso.fl_str_mv eng
language eng
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
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/6973/2/license.txt
http://www.repositorio.ufop.br/bitstream/123456789/6973/1/ARTIGO_ComputacionalStudyConflit.pdf
bitstream.checksum.fl_str_mv 62604f8d955274beb56c80ce1ee5dcae
2f57f74bb9cd42b44454de64a92b120c
bitstream.checksumAlgorithm.fl_str_mv 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_ 1801685750581821440

Registros relacionados