Minimal-cost network flow problems with variable lower bounds on arc flows (Q632657): Difference between revisions

@@ Property / DOI @@
-.1016/j.cor.2010.11.006
@@ Property / DOI: 10.1016/j.cor.2010.11.006 / rank @@
-Normal rank
@@ 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.cor.2010.11.006
+Normal rank
@@ Property / OpenAlex ID @@
+W2090539371
@@ Property / OpenAlex ID: W2090539371 / rank @@
+Normal rank
@@ Property / cites work @@
+Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems
+Normal rank
@@ Property / cites work @@
+A polynomial combinatorial algorithm for generalized minimum cost flow
+Normal rank
@@ Property / cites work @@
+Q3056948
@@ Property / cites work: Q3056948 / rank @@
+Normal rank
@@ Property / cites work @@
+A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems
+Normal rank
@@ Property / cites work @@
+Q5519729
@@ Property / cites work: Q5519729 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5514188
@@ Property / cites work: Q5514188 / rank @@
+Normal rank
@@ Property / cites work @@
+An Out-of-Kilter Method for Minimal-Cost Flow Problems
+Normal rank
@@ Property / cites work @@
+Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
+Normal rank
@@ Property / cites work @@
+Q3908745
@@ Property / cites work: Q3908745 / 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 @@
+Q3802859
@@ Property / cites work: Q3802859 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5808729
@@ Property / cites work: Q5808729 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4673630
@@ Property / cites work: Q4673630 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3968758
@@ Property / cites work: Q3968758 / rank @@
+Normal rank
@@ Property / cites work @@
+Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms
+Normal rank
@@ Property / cites work @@
+Pivot Strategies for Primal-Simplex Network Codes
@@ Property / cites work: Pivot Strategies for Primal-Simplex Network Codes / rank @@
+Normal rank
@@ Property / cites work @@
+Solving the Convex Cost Integer Dual Network Flow Problem
+Normal rank
@@ Property / cites work @@
+Minimum Convex Cost Dynamic Network Flows
@@ Property / cites work: Minimum Convex Cost Dynamic Network Flows / rank @@
+Normal rank
@@ Property / cites work @@
+A Primal Algorithm to Solve Network Flow Problems with Convex Costs
+Normal rank
@@ Property / cites work @@
+New formulation and relaxation to solve a concave-cost network flow problem
+Normal rank
@@ Property / cites work @@
+Send-and-Split Method for Minimum-Concave-Cost Network Flows
+Normal rank
@@ Property / cites work @@
+Minimum Concave Cost Flows in Certain Networks
@@ Property / cites work: Minimum Concave Cost Flows in Certain Networks / rank @@
+Normal rank
@@ Property / cites work @@
+Cost Minimization in Networks with Discrete Stochastic Requirements
+Normal rank
@@ Property / cites work @@
+Using mathematical programming heuristics in a multicriteria network flow context
+Normal rank
@@ Property / cites work @@
+Application of fuzzy minimum cost flow problems to network design under uncertainty
+Normal rank
@@ Property / cites work @@
+Fuzzy multi-level minimum cost flow problems
@@ Property / cites work: Fuzzy multi-level minimum cost flow problems / rank @@
+Normal rank
@@ Property / cites work @@
+Supply chain optimization.
@@ Property / cites work: Supply chain optimization. / rank @@
+Normal rank
@@ Property / cites work @@
+Some branch-and-bound procedures for fixed-cost transportation problems
+Normal rank
@@ Property / cites work @@
+A Branch-and-Bound Method for the Fixed Charge Transportation Problem
+Normal rank
@@ Property / cites work @@
+A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem
+Normal rank
@@ Property / cites work @@
+Solving to optimality the uncapacitated fixed-charge network flow problem
+Normal rank
@@ Property / cites work @@
+A survey on Benders decomposition applied to fixed-charge network design problems
+Normal rank
@@ Property / cites work @@
+Tabu search applied to the general fixed charge problem
+Normal rank
@@ Property / cites work @@
+A Heuristic Adjacent Extreme Point Algorithm for the Fixed Charge Problem
+Normal rank
@@ Property / DOI @@
+.1016/J.COR.2010.11.006
@@ Property / DOI: 10.1016/J.COR.2010.11.006 / rank @@
+Normal rank