Repository landing page

We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
oaioai:ojs.www4063.vu.lt:article/14047

An unconstrained binary quadratic programming for the maximum independent set problem

Authors
Publication date
25 October 2012
Publisher
Vilnius University Press
Doi

    Abstract

    For a given graph G = (V, E) the maximum independent set problem is to find the largest subset of pairwise nonadjacent vertices. We propose a new model which is a reformulation of the maximum independent set problem as an unconstrained quadratic binary programming, and we resolve it afterward by means of a genetic algorithm. The efficiency of the approach is confirmed by results of numerical experiments on DIMACS benchmarks

    Similar works

    Full text

    thumbnail-image

    Nonlinear Analysis: Modelling and Control

    redirect
    oaioai:ojs.www4063.vu.lt:article/...
    Last time updated on 15/05/2020

    This paper was published in Nonlinear Analysis: Modelling and Control.

    Having an issue?

    Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.