A deterministic annealing algorithm for approximating a solution of the min-bisection problem (Q280315): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.neunet.2008.09.008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4233980468 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q47245591 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921750 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3127252 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genetic algorithm and graph partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4326408 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrange Multiplier and Hopfield-Type Barrier Function Method for the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polylogarithmic Approximation of the Minimum Bisection / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: ``Neural'' computation of decisions in optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bisecting a 4-connected graph with three resource sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Metropolis algorithm for graph bisection / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Heuristic Procedure for Partitioning Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey for the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3738922 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some NP-complete problems in quadratic and nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the graph bisection problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4034535 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combined evolutionary search and multilevel optimisation approach to graph-partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: A neural network algorithm for the multiple traveling salesman problem / rank
 
Normal rank

Latest revision as of 23:05, 11 July 2024

scientific article
Language Label Description Also known as
English
A deterministic annealing algorithm for approximating a solution of the min-bisection problem
scientific article

    Statements

    A deterministic annealing algorithm for approximating a solution of the min-bisection problem (English)
    0 references
    0 references
    0 references
    0 references
    10 May 2016
    0 references
    log-cos barrier function
    0 references
    descent direction
    0 references
    deterministic annealing
    0 references
    iterative algorithm
    0 references

    Identifiers