Bounds for global optimization of capacity expansion and flow assignment problems (Q1591547): Difference between revisions

@@ Property / cites work @@
+Hidden convexity in some nonconvex quadratically constrained quadratic programming
+Normal rank
@@ Property / cites work @@
+Lagrange Multipliers and Nonconvex Programs
@@ Property / cites work: Lagrange Multipliers and Nonconvex Programs / rank @@
+Normal rank
@@ Property / cites work @@
+The flow deviation method: An approach to store‐and‐forward communication network design
+Normal rank
@@ Property / cites work @@
+Q3141900
@@ Property / cites work: Q3141900 / rank @@
+Normal rank
@@ Property / cites work @@
+Convex separable optimization is not much harder than linear optimization
+Normal rank
@@ Property / cites work @@
+Optimization on low rank nonconvex structures
@@ Property / cites work: Optimization on low rank nonconvex structures / rank @@
+Normal rank
@@ Property / cites work @@
+A Survey of Algorithms for Convex Multicommodity Flow Problems
+Normal rank
@@ Property / cites work @@
+Strongly polynomial time algorithms for certain concave minimization problems on networks
+Normal rank