An improved cut-and-solve algorithm for the single-source capacitated facility location problem (Q1742898): Difference between revisions

@@ Property / DOI @@
-.1007/s13675-017-0084-4
@@ Property / DOI: 10.1007/s13675-017-0084-4 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2604493856
@@ Property / OpenAlex ID: W2604493856 / rank @@
+Normal rank
@@ Property / cites work @@
+A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem
+Normal rank
@@ Property / cites work @@
+Facets of the Knapsack Polytope From Minimal Covers
+Normal rank
@@ Property / cites work @@
+A heuristic lagrangean algorithm for the capacitated plant location problem
+Normal rank
@@ Property / cites work @@
+Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem
+Normal rank
@@ Property / cites work @@
+Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing
+Normal rank
@@ Property / cites work @@
+Inverse Optimization: An Application to the Capacitated Plant Location Problem
+Normal rank
@@ Property / cites work @@
+A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes
+Normal rank
@@ Property / cites work @@
+Generating Fenchel Cutting Planes for Knapsack Polyhedra
+Normal rank
@@ Property / cites work @@
+A branch‐and‐price algorithm for the capacitated <i>p</i>‐median problem
+Normal rank
@@ Property / cites work @@
+Cut-and-solve: An iterative search strategy for combinatorial optimization problems
+Normal rank
@@ Property / cites work @@
+Scatter search for the single source capacitated facility location problem
+Normal rank
@@ Property / cites work @@
+A comparison of heuristics and relaxations for the capacitated plant location problem
+Normal rank
@@ Property / cites work @@
+Discretized formulations for capacitated location problems with modular distribution costs
+Normal rank
@@ Property / cites work @@
+A Branch-and-Price algorithm for the Single Source Capacitated Plant Location Problem
+Normal rank
@@ Property / cites work @@
+Local branching
@@ Property / cites work: Local branching / rank @@
+Normal rank
@@ Property / cites work @@
+A local branching heuristic for mixed-integer programs with 2-level variables, with an application to a telecommunication network design problem
+Normal rank
@@ Property / cites work @@
+Q4178782
@@ Property / cites work: Q4178782 / rank @@
+Normal rank
@@ Property / cites work @@
+An exact algorithm for the capacitated facility location problems with single sourcing
+Normal rank
@@ Property / cites work @@
+Separation algorithms for 0-1 knapsack polytopes
@@ Property / cites work: Separation algorithms for 0-1 knapsack polytopes / rank @@
+Normal rank
@@ Property / cites work @@
+Reducibility among Combinatorial Problems
@@ Property / cites work: Reducibility among Combinatorial Problems / rank @@
+Normal rank
@@ Property / cites work @@
+A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints
+Normal rank
@@ Property / cites work @@
+A branch-and-price algorithm for the capacitated facility location problem
+Normal rank
@@ Property / cites work @@
+Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
+Normal rank
@@ Property / cites work @@
+An Algorithm for the Fixed-Charge Assigning Users to Sources Problem
+Normal rank
@@ Property / cites work @@
+Q4040221
@@ Property / cites work: Q4040221 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for the capacitated concentrator location problem
+Normal rank
@@ Property / cites work @@
+A repeated matching heuristic for the single-source capacitated facility location problem
+Normal rank
@@ Property / cites work @@
+A Lagrangian heuristic for the capacitated plant location problem with single source constraints
+Normal rank
@@ Property / cites work @@
+On the \(0/1\) knapsack polytope
@@ Property / cites work: On the \(0/1\) knapsack polytope / rank @@
+Normal rank
@@ Property / cites work @@
+A cut-and-solve based algorithm for the single-source capacitated facility location problem
+Normal rank
@@ Property / DOI @@
+.1007/S13675-017-0084-4
@@ Property / DOI: 10.1007/S13675-017-0084-4 / rank @@
+Normal rank