A new Lagrangian net algorithm for solving max-bisection problems (Q544198): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| 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 | |||
Revision as of 11:00, 1 July 2023
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
14 June 2011
0 references
max-bisection problem
0 references
discrete Hopfield network
0 references
multiplier penalty function
0 references
