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

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.cam.2011.01.015
+Normal rank
@@ Property / OpenAlex ID @@
+W2066635959
@@ Property / OpenAlex ID: W2066635959 / rank @@
+Normal rank
@@ Property / cites work @@
+Some NP-complete problems in quadratic and nonlinear programming
+Normal rank
@@ Property / cites work @@
+Q4526964
@@ Property / cites work: Q4526964 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4234075
@@ Property / cites work: Q4234075 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
+Normal rank
@@ Property / cites work @@
+Q3499508
@@ Property / cites work: Q3499508 / rank @@
+Normal rank
@@ Property / cites work @@
+A .699-approximation algorithm for Max-Bisection.
@@ Property / cites work: A .699-approximation algorithm for Max-Bisection. / rank @@
+Normal rank
@@ Property / cites work @@
+A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems
+Normal rank
@@ Property / cites work @@
+``Neural'' computation of decisions in optimization problems
+Normal rank
@@ Property / cites work @@
+Q4326408
@@ Property / cites work: Q4326408 / rank @@
+Normal rank
@@ Property / cites work @@
+Neural networks in optimization
@@ Property / cites work: Neural networks in optimization / rank @@
+Normal rank
@@ Property / cites work @@
+Neural Networks for Combinatorial Optimization: A Review of More Than a Decade of Research
+Normal rank
@@ Property / cites work @@
+Q4127646
@@ Property / cites work: Q4127646 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3338296
@@ Property / cites work: Q3338296 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5716604
@@ Property / cites work: Q5716604 / rank @@
+Normal rank