A cut-and-solve based algorithm for the single-source capacitated facility location problem
type: Item
instance of: scholarly article
title: A cut-and-solve based algorithm for the single-source capacitated facility location problem
zbMATH Open document ID: 1253.90143
author: Zhen Yang
author: Feng Chu
author: Haoxun Chen
published in: European Journal of Operational Research
publication date: 2012-12-29T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 6119469
zbMATH Keywords: facility location
zbMATH Keywords: cutting-plane method
zbMATH Keywords: cut-and-solve
describes a project that uses: Knapsack
describes a project that uses: CPLEX
MaRDI profile type: Publication
full work available at URL: j.ejor.2012.03.047
OpenAlex ID: W2067093916
cites work: Lagrangean heuristics applied to a variety of large capacitated plant location problems
cites work: A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem
cites work: Facets of the knapsack polytope
cites work: Facets of the Knapsack Polytope From Minimal Covers
cites work: A heuristic lagrangean algorithm for the capacitated plant location problem
cites work: Lagrangean heuristics for location problems
cites work: A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes
cites work: Generating Fenchel Cutting Planes for Knapsack Polyhedra
cites work: Q4234144
cites work: Fenchel Cutting Planes for Integer Programs
cites work: A branch‐and‐price algorithm for the capacitated p‐median problem
cites work: Cut-and-solve: An iterative search strategy for combinatorial optimization problems
cites work: Scatter search for the single source capacitated facility location problem
cites work: A comparison of heuristics and relaxations for the capacitated plant location problem
cites work: Upper and lower bounds for the single source capacitated location problem.
cites work: Solving Large-Scale Zero-One Linear Programming Problems
cites work: Reactive Grasp And Tabu Search Based Heuristics For The Single Source Capacitated Plant Location Problem
cites work: A Branch-and-Price algorithm for the Single Source Capacitated Plant Location Problem
cites work: Solving Multiple Knapsack Problems by Cutting Planes
cites work: Lifted Cover Inequalities for 0-1 Integer Programs: Complexity
cites work: Sequence independent lifting in mixed integer programming
cites work: An exact algorithm for the capacitated facility location problems with single sourcing
cites work: Separation algorithms for 0-1 knapsack polytopes
cites work: The complexity of cover inequality separation
cites work: A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints
cites work: A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem
cites work: An Algorithm for the Fixed-Charge Assigning Users to Sources Problem
cites work: Efficient algorithms for the capacitated concentrator location problem
cites work: An expanding-core algorithm for the exact \(0-1\) knapsack problem
cites work: Solving capacitated facility location problems by Fenchel cutting planes
cites work: A repeated matching heuristic for the single-source capacitated facility location problem
cites work: A Lagrangian heuristic for the capacitated plant location problem with single source constraints
cites work: On the \(0/1\) knapsack polytope
DOI: 10.1016/J.EJOR.2012.03.047
Recommended article: An improved cut-and-solve algorithm for the single-source capacitated facility location problem
Recommended article: An exact algorithm for the capacitated facility location problems with single sourcing
Recommended article: A cutting plane algorithm for the capacitated facility location problem
Recommended article: A cutting plane algorithm for the capacitated connected facility location problem
Recommended article: Benders-type branch-and-cut algorithms for capacitated facility location with single-sourcing
Recommended article: Q3840283
Recommended article: An exact method for the two-echelon, single-source, capacitated facility location problem
Recommended article: A branch-and-cut algorithm for a generalization of the uncapacitated facility location problem
Recommended article: Solving capacitated facility location problems by Fenchel cutting planes
Recommended article: A dual RAMP algorithm for single source capacitated facility location problems
description: scientific article; zbMATH DE number 6119469