The graph bisection minimization problem

Detalhes bibliográficos
Autor(a) principal: Luz,Carlos J.
Data de Publicação: 2003
Tipo de documento: Artigo
Idioma: eng
Título da fonte: Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
Texto Completo: http://scielo.pt/scielo.php?script=sci_arttext&pid=S0874-51612003000100006
Resumo: A method of determining a lower bound for the graph bisection minimization problem is described. The bound is valid for weigthed graphs with edge and node weights. The approach is based on Lagrangian relaxation and was previously used for determining an upper bound on the independence number of a graph. The determination of the lower bound is done by solving a quadratic programming problem. A characterization of the solutions of this problem is proved which allows to approximate the optimal solution of the graph bisection minimization problem. Some computational experiments are reported.
id RCAP_dc14dfc95ae8a71ec67dbcc31fb39ea6
oai_identifier_str oai:scielo:S0874-51612003000100006
network_acronym_str RCAP
network_name_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository_id_str 7160
spelling The graph bisection minimization problemCombinatorial OptimizationGraph Bisection ProblemQuadratic ProgrammingA method of determining a lower bound for the graph bisection minimization problem is described. The bound is valid for weigthed graphs with edge and node weights. The approach is based on Lagrangian relaxation and was previously used for determining an upper bound on the independence number of a graph. The determination of the lower bound is done by solving a quadratic programming problem. A characterization of the solutions of this problem is proved which allows to approximate the optimal solution of the graph bisection minimization problem. Some computational experiments are reported.APDIO - Associação Portuguesa de Investigação Operacional2003-06-01info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articletext/htmlhttp://scielo.pt/scielo.php?script=sci_arttext&pid=S0874-51612003000100006Investigação Operacional v.23 n.1 2003reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAPenghttp://scielo.pt/scielo.php?script=sci_arttext&pid=S0874-51612003000100006Luz,Carlos J.info:eu-repo/semantics/openAccess2024-02-06T17:14:04Zoai:scielo:S0874-51612003000100006Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-20T02:24:07.000780Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse
dc.title.none.fl_str_mv The graph bisection minimization problem
title The graph bisection minimization problem
spellingShingle The graph bisection minimization problem
Luz,Carlos J.
Combinatorial Optimization
Graph Bisection Problem
Quadratic Programming
title_short The graph bisection minimization problem
title_full The graph bisection minimization problem
title_fullStr The graph bisection minimization problem
title_full_unstemmed The graph bisection minimization problem
title_sort The graph bisection minimization problem
author Luz,Carlos J.
author_facet Luz,Carlos J.
author_role author
dc.contributor.author.fl_str_mv Luz,Carlos J.
dc.subject.por.fl_str_mv Combinatorial Optimization
Graph Bisection Problem
Quadratic Programming
topic Combinatorial Optimization
Graph Bisection Problem
Quadratic Programming
description A method of determining a lower bound for the graph bisection minimization problem is described. The bound is valid for weigthed graphs with edge and node weights. The approach is based on Lagrangian relaxation and was previously used for determining an upper bound on the independence number of a graph. The determination of the lower bound is done by solving a quadratic programming problem. A characterization of the solutions of this problem is proved which allows to approximate the optimal solution of the graph bisection minimization problem. Some computational experiments are reported.
publishDate 2003
dc.date.none.fl_str_mv 2003-06-01
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.uri.fl_str_mv http://scielo.pt/scielo.php?script=sci_arttext&pid=S0874-51612003000100006
url http://scielo.pt/scielo.php?script=sci_arttext&pid=S0874-51612003000100006
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv http://scielo.pt/scielo.php?script=sci_arttext&pid=S0874-51612003000100006
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv text/html
dc.publisher.none.fl_str_mv APDIO - Associação Portuguesa de Investigação Operacional
publisher.none.fl_str_mv APDIO - Associação Portuguesa de Investigação Operacional
dc.source.none.fl_str_mv Investigação Operacional v.23 n.1 2003
reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron:RCAAP
instname_str Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron_str RCAAP
institution RCAAP
reponame_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
collection Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository.name.fl_str_mv Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
repository.mail.fl_str_mv
_version_ 1799137319315308544

Registros relacionados