A computational study of using preprocessing and stronger formulations to solve large general fixed charge problems (Q1823858): Difference between revisions

@@ Property / cites work @@
+A New Optimization Method for Large Scale Fixed Charge Transportation Problems
+Normal rank
@@ Property / cites work @@
+A New Branch-and-Bound Algorithm for the Fixed-Charge Transportation Problem
+Normal rank
@@ Property / cites work @@
+Technical Note—A Vertex Ranking Procedure for Solving the Linear Fixed-Charge Problem
+Normal rank
@@ Property / cites work @@
+A branch-and-bound algorithm for solving fixed charge problems
+Normal rank
@@ Property / cites work @@
+The fixed charge problem
@@ Property / cites work: The fixed charge problem / rank @@
+Normal rank
@@ Property / cites work @@
+Concave minimization over a convex polyhedron
@@ Property / cites work: Concave minimization over a convex polyhedron / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Penalties for Fixed Cost Linear Programs Using Lagrangean Relaxation
+Normal rank
@@ Property / cites work @@
+Solving the fixed charge problem with Lagrangian relaxation and cost allocation heuristics
+Normal rank
@@ Property / cites work @@
+The interactive fixed charge linear programming problem
+Normal rank
@@ Property / cites work @@
+Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
+Normal rank
@@ Property / cites work @@
+A Heuristic Adjacent Extreme Point Algorithm for the Fixed Charge Problem
+Normal rank