A new Lagrangian net algorithm for solving max-bisection problems (Q544198): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Some NP-complete problems in quadratic and nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526964 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3499508 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A .699-approximation algorithm for Max-Bisection. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems / 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: Q4326408 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neural networks in optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neural Networks for Combinatorial Optimization: A Review of More Than a Decade of Research / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4127646 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3338296 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5716604 / rank
 
Normal rank

Latest revision as of 04:31, 4 July 2024

scientific article
Language Label Description Also known as
English
A new Lagrangian net algorithm for solving max-bisection problems
scientific article

    Statements

    A new Lagrangian net algorithm for solving max-bisection problems (English)
    0 references
    0 references
    0 references
    0 references
    14 June 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    max-bisection problem
    0 references
    discrete Hopfield network
    0 references
    multiplier penalty function
    0 references
    0 references