Lagrangian dual ascent by generalized linear programming (Q1123118): Difference between revisions

@@ Property / cites work @@
+Q3932576
@@ Property / cites work: Q3932576 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3694971
@@ Property / cites work: Q3694971 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3844775
@@ Property / cites work: Q3844775 / rank @@
+Normal rank
@@ Property / cites work @@
+Decomposition Principle for Linear Programs
@@ Property / cites work: Decomposition Principle for Linear Programs / rank @@
+Normal rank
@@ Property / cites work @@
+The Decomposition Algorithm for Linear Programs
@@ Property / cites work: The Decomposition Algorithm for Linear Programs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4145425
@@ Property / cites work: Q4145425 / rank @@
+Normal rank
@@ Property / cites work @@
+The Lagrangian Relaxation Method for Solving Integer Programming Problems
+Normal rank
@@ Property / cites work @@
+The Traveling-Salesman Problem and Minimum Spanning Trees
+Normal rank
@@ Property / cites work @@
+Generalized Linear Programming Solves the Dual
@@ Property / cites work: Generalized Linear Programming Solves the Dual / rank @@
+Normal rank
@@ Property / cites work @@
+Q5566712
@@ Property / cites work: Q5566712 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimization of unsmooth functionals
@@ Property / cites work: Minimization of unsmooth functionals / rank @@
+Normal rank
@@ Property / cites work @@
+Convergence Conditions for Nonlinear Programming Algorithms
+Normal rank