A technique for speeding up the solution of the Lagrangean dual (Q1315429): Difference between revisions

@@ Property / Wikidata QID @@
+Q59592629
@@ Property / Wikidata QID: Q59592629 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding minimum-cost flows by double scaling
@@ Property / cites work: Finding minimum-cost flows by double scaling / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Algorithms for Bipartite Network Flow
@@ Property / cites work: Improved Algorithms for Bipartite Network Flow / rank @@
+Normal rank
@@ Property / cites work @@
+A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design
+Normal rank
@@ Property / cites work @@
+An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
+Normal rank
@@ Property / cites work @@
+Uncapacitated lot-sizing: The convex hull of solutions
+Normal rank
@@ Property / cites work @@
+Q3100582
@@ Property / cites work: Q3100582 / rank @@
+Normal rank
@@ Property / cites work @@
+Matrix multiplication via arithmetic progressions
@@ Property / cites work: Matrix multiplication via arithmetic progressions / rank @@
+Normal rank
@@ Property / cites work @@
+Solving Large-Scale Zero-One Linear Programming Problems
+Normal rank
@@ Property / cites work @@
+Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
+Normal rank
@@ Property / cites work @@
+Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
+Normal rank
@@ Property / cites work @@
+The Lagrangian Relaxation Method for Solving Integer Programming Problems
+Normal rank
@@ Property / cites work @@
+Q4178782
@@ Property / cites work: Q4178782 / rank @@
+Normal rank
@@ Property / cites work @@
+Survivable networks, linear programming relaxations and the parsimonious property
+Normal rank
@@ Property / cites work @@
+A Cutting Plane Algorithm for the Linear Ordering Problem
+Normal rank
@@ Property / cites work @@
+Geometric algorithms and combinatorial optimization
+Normal rank
@@ Property / cites work @@
+The Traveling-Salesman Problem and Minimum Spanning Trees
+Normal rank
@@ Property / cites work @@
+The traveling-salesman problem and minimum spanning trees: Part II
+Normal rank
@@ Property / cites work @@
+Validation of subgradient optimization
@@ Property / cites work: Validation of subgradient optimization / rank @@
+Normal rank
@@ Property / cites work @@
+Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models
+Normal rank
@@ Property / cites work @@
+A new Lagrangian relaxation approach to the generalized assignment problem
+Normal rank
@@ Property / cites work @@
+Facets and algorithms for capacitated lot sizing
@@ Property / cites work: Facets and algorithms for capacitated lot sizing / rank @@
+Normal rank
@@ Property / cites work @@
+Tailoring Benders decomposition for uncapacitated network design
+Normal rank
@@ Property / cites work @@
+A Strong Cutting Plane Algorithm for Production Scheduling with Changeover Costs
+Normal rank
@@ Property / cites work @@
+Q4943600
@@ Property / cites work: Q4943600 / rank @@
+Normal rank
@@ Property / cites work @@
+On the symmetric travelling salesman problem: A computational study
+Normal rank
@@ Property / cites work @@
+Optimization of a 532-city symmetric traveling salesman problem by branch and cut
+Normal rank
@@ Property / cites work @@
+Fast Approximation Algorithms for Fractional Packing and Covering Problems
+Normal rank
@@ Property / cites work @@
+Q3968756
@@ Property / cites work: Q3968756 / rank @@
+Normal rank
@@ Property / cites work @@
+A new algorithm for minimizing convex functions over convex sets
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf01582057
+Normal rank
@@ Property / OpenAlex ID @@
+W1993986344
@@ Property / OpenAlex ID: W1993986344 / rank @@
+Normal rank