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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 6 users not shown)
Property / author
 
Property / author: Feng-Min Xu / rank
Normal rank
 
Property / author
 
Property / author: Feng-Min Xu / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C85 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C27 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 5907699 / rank
 
Normal rank
Property / zbMATH Keywords
 
max-bisection problem
Property / zbMATH Keywords: max-bisection problem / rank
 
Normal rank
Property / zbMATH Keywords
 
discrete Hopfield network
Property / zbMATH Keywords: discrete Hopfield network / rank
 
Normal rank
Property / zbMATH Keywords
 
multiplier penalty function
Property / zbMATH Keywords: multiplier penalty function / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SDPpack / rank
 
Normal rank
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.cam.2011.01.015 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2066635959 / 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: 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
links / mardi / namelinks / mardi / name
 

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