A cut-and-solve based algorithm for the single-source capacitated facility location problem (Q1926885): Difference between revisions

@@ Property / DOI @@
-.1016/j.ejor.2012.03.047
@@ Property / DOI: 10.1016/j.ejor.2012.03.047 / rank @@
-Normal rank
@@ Property / describes a project that uses @@
+Knapsack
@@ Property / describes a project that uses: Knapsack / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+CPLEX
@@ Property / describes a project that uses: CPLEX / 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.ejor.2012.03.047
+Normal rank
@@ Property / OpenAlex ID @@
+W2067093916
@@ Property / OpenAlex ID: W2067093916 / rank @@
+Normal rank
@@ Property / cites work @@
+Lagrangean heuristics applied to a variety of large capacitated plant location problems
+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
@@ Property / cites work: Facets of the knapsack polytope / rank @@
+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 @@
+Lagrangean heuristics for location problems
@@ Property / cites work: Lagrangean heuristics for location problems / rank @@
+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 @@
+Q4234144
@@ Property / cites work: Q4234144 / rank @@
+Normal rank
@@ Property / cites work @@
+Fenchel Cutting Planes for Integer Programs
@@ Property / cites work: Fenchel Cutting Planes for Integer Programs / rank @@
+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 @@
+Upper and lower bounds for the single source capacitated location problem.
+Normal rank
@@ Property / cites work @@
+Solving Large-Scale Zero-One Linear Programming Problems
+Normal rank
@@ Property / cites work @@
+Reactive Grasp And Tabu Search Based Heuristics For The Single Source Capacitated Plant Location Problem
+Normal rank
@@ Property / cites work @@
+A Branch-and-Price algorithm for the Single Source Capacitated Plant Location Problem
+Normal rank
@@ Property / cites work @@
+Solving Multiple Knapsack Problems by Cutting Planes
+Normal rank
@@ Property / cites work @@
+Lifted Cover Inequalities for 0-1 Integer Programs: Complexity
+Normal rank
@@ Property / cites work @@
+Sequence independent lifting in mixed integer programming
+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 @@
+The complexity of cover inequality separation
@@ Property / cites work: The complexity of cover inequality separation / rank @@
+Normal rank
@@ Property / cites work @@
+A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints
+Normal rank
@@ Property / cites work @@
+A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem
+Normal rank
@@ Property / cites work @@
+An Algorithm for the Fixed-Charge Assigning Users to Sources Problem
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for the capacitated concentrator location problem
+Normal rank
@@ Property / cites work @@
+An expanding-core algorithm for the exact \(0-1\) knapsack problem
+Normal rank
@@ Property / cites work @@
+Solving capacitated facility location problems by Fenchel cutting planes
+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 / DOI @@
+.1016/J.EJOR.2012.03.047
@@ Property / DOI: 10.1016/J.EJOR.2012.03.047 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1926885