An effective iterated tabu search for the maximum bisection problem (Q1652221)

From MaRDI portal
Revision as of 23:24, 20 March 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q56524032, #quickstatements; #temporary_batch_1710972793655)
scientific article
Language Label Description Also known as
English
An effective iterated tabu search for the maximum bisection problem
scientific article

    Statements

    An effective iterated tabu search for the maximum bisection problem (English)
    0 references
    0 references
    0 references
    0 references
    11 July 2018
    0 references
    max-bisection
    0 references
    graph partition
    0 references
    multiple search strategies
    0 references
    tabu search
    0 references
    heuristics
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references