Publicação
The graph bisection minimization problem
| 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. |
|---|---|
| Autores principais: | Luz,Carlos J. |
| Assunto: | Combinatorial Optimization Graph Bisection Problem Quadratic Programming |
| Ano: | 2003 |
| País: | Portugal |
| Tipo de documento: | artigo |
| Tipo de acesso: | acesso aberto |
| Instituição associada: | Fundação para a Ciência e Tecnologia |
| Idioma: | inglês |
| Origem: | SciELO Portugal |
| _version_ | 1868441781161426944 |
|---|---|
| author | Luz,Carlos J. |
| author_facet | Luz,Carlos J. |
| author_role | author |
| country_str | PT |
| creators_json_txt | [{\"Person.name\":\"Luz,Carlos J.\"}] |
| datacite.creators.creator.creatorName.fl_str_mv | Luz,Carlos J. |
| datacite.rights.fl_str_mv | http://purl.org/coar/access_right/c_abf2 |
| datacite.subjects.subject.fl_str_mv | Combinatorial Optimization Graph Bisection Problem Quadratic Programming |
| datacite.titles.title.fl_str_mv | The graph bisection minimization problem |
| dc.creator.none.fl_str_mv | Luz,Carlos J. |
| dc.format.none.fl_str_mv | text/html |
| dc.identifier.none.fl_str_mv | http://scielo.pt/scielo.php?script=sci_arttext&pid=S0874-51612003000100006 |
| dc.language.none.fl_str_mv | eng |
| dc.publisher.none.fl_str_mv | APDIO - Associação Portuguesa de Investigação Operacional |
| dc.rights.none.fl_str_mv | http://purl.org/coar/access_right/c_abf2 |
| dc.source.none.fl_str_mv | Investigação Operacional v.23 n.1 2003 |
| dc.subject.none.fl_str_mv | Combinatorial Optimization Graph Bisection Problem Quadratic Programming |
| dc.title.fl_str_mv | The graph bisection minimization problem |
| dc.type.none.fl_str_mv | http://purl.org/coar/resource_type/c_6501 |
| 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. |
| dirty | 0 |
| eu_rights_str_mv | openAccess |
| format | article |
| id | scielopt_dc14dfc95ae8a71ec67dbcc31fb39ea6 |
| identifier.url.fl_str_mv | http://scielo.pt/scielo.php?script=sci_arttext&pid=S0874-51612003000100006 |
| instacron_str | SciELO |
| institution | Fundação para a Ciência e Tecnologia |
| instname_str | Fundação para a Ciência e Tecnologia |
| language | eng |
| network_acronym_str | scielopt |
| network_name_str | SciELO Portugal |
| oai_identifier_str | oai:scielo:S0874-51612003000100006 |
| organization_str_mv | urn:organizationAcronym:scielo |
| person_str_mv | Luz,Carlos J. |
| publishDate | 2003 |
| publisher.none.fl_str_mv | APDIO - Associação Portuguesa de Investigação Operacional |
| reponame_str | SciELO Portugal |
| repository_id_str | urn:repositoryAcronym:scielopt |
| service_str_mv | urn:repositoryAcronym:scielopt |
| spelling | The graph bisection minimization problemLuz,Carlos J.Combinatorial OptimizationGraph Bisection ProblemQuadratic Programmingopen accesshttp://purl.org/coar/access_right/c_abf2http://scielo.pt/scielo.php?script=sci_arttext&pid=S0874-51612003000100006URLhttp://scielo.pt/scielo.php?script=sci_arttext&pid=S0874-51612003000100006URLHasVersion2003-06-01A 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 OperacionalInvestigação Operacional v.23 n.1 2003text/htmlengjournal articlehttp://purl.org/coar/resource_type/c_6501literature |
| spellingShingle | The graph bisection minimization problem Luz,Carlos J. Combinatorial Optimization Graph Bisection Problem Quadratic Programming |
| status | SINGLETON |
| subject.fl_str_mv | Combinatorial Optimization Graph Bisection Problem Quadratic Programming |
| title | 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_short | The graph bisection minimization problem |
| title_sort | The graph bisection minimization problem |
| topic | Combinatorial Optimization Graph Bisection Problem Quadratic Programming |
| topic_facet | Combinatorial Optimization Graph Bisection Problem Quadratic Programming |
| url | http://scielo.pt/scielo.php?script=sci_arttext&pid=S0874-51612003000100006 |
| visible | 1 |