Contribution of copositive formulations to the graph partitioning problem

ISSN： 0233-1934

Source： Optimization, Vol.62, Iss.1, 2013-01, pp. : 71-83

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Two Novel Evolutionary Formulations of the Graph Coloring Problem

By Barbosa Valmir C. Assis Carlos A.G. Do Nascimento Josina O.

Journal of Combinatorial Optimization, Vol. 8, Iss. 1, 2004-03 ,pp. : 41-63

Springer Publishing Company

Access to resources Recommend Favorite

Homeomorphic graph manifolds: A contribution to the constant problem

By Perron B. Shalen P.

Topology and its Applications, Vol. 99, Iss. 1, 1999-11 ,pp. : 1-39

Elsevier

Access to resources Recommend Favorite

Finding optimal solutions to the graph partitioning problem with heuristic search

By Felner Ariel

Annals of Mathematics and Artificial Intelligence, Vol. 45, Iss. 3-4, 2005-12 ,pp. : 293-322

Springer Publishing Company

Access to resources Recommend Favorite

Partitioning a graph into vertex-disjoint paths

By Li Jianping Steiner George

Studia Scientiarum Mathematicarum Hungarica, Vol. 42, Iss. 3, 2005-08 ,pp. : 277-294

Akademiai Kiado

Access to resources Recommend Favorite

A Graph Partition Problem

By Cioabă Sebastian M. Cameron Peter J.

American Mathematical Monthly, Vol. 122, Iss. 10, 2015-12 ,pp. : 972-981

Mathematical Association of America

Access to resources Recommend Favorite