An exact cooperative method for the uncapacitated facility location problem
type: Item
instance of: scholarly article
title: An exact cooperative method for the uncapacitated facility location problem
zbMATH Open document ID: 1327.90094
author: Marius Posta
author: Jacques A. Ferland
author: Philippe Michelon
published in: Mathematical Programming Computation
publication date: 2015-09-16T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C56
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 6482770
describes a project that uses: CPLEX
describes a project that uses: Scatter Search
describes a project that uses: Gurobi
MaRDI profile type: Publication
full work available at URL: s12532-014-0065-z
OpenAlex ID: W1976845059
cites work: The volume algorithm: Producing primal solutions with a subgradient method
cites work: Lagrangean heuristics for location problems
cites work: Solving the \(p\)-median problem with a semi-Lagrangian relaxation
cites work: Semi-Lagrangian relaxation applied to the uncapacitated facility location problem
cites work: Q4139967
cites work: Space/time trade-offs in hash coding with allowable errors
cites work: An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
cites work: A projection method for the uncapacitated facility location problem
cites work: Q3351135
cites work: A Dual-Based Procedure for Uncapacitated Facility Location
cites work: On the Average Case Performance of Some Greedy Approximation Algorithms For the Uncapacitated Facility Location Problem
cites work: A method for solving to optimality uncapacitated location problems
cites work: Neighborhood search heuristics for the uncapacitated facility location problem
cites work: Branch and peg algorithms for the simple plant location problem.
cites work: Solving the simple plant location problem using a data correcting approach
cites work: Primal-dual variable neighborhood search for the simple plant-location problem
cites work: Q3141900
cites work: A note on duality gap in the simple plant location problem
cites work: A Permutation Coding with Heuristics for the Uncapacitated Facility Location Problem
cites work: On the exact solution of large-scale simple plant location problems
cites work: The simple plant location problem: Survey and synthesis
cites work: Solving the simple plant location problem by genetic algorithm
cites work: Q4398373
cites work: An aggressive reduction scheme for the simple plant location problem
cites work: Fast bounding procedures for large instances of the simple plant location problem
cites work: A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem
cites work: Approximation Algorithms for Metric Facility Location Problems
cites work: A simple tabu search for warehouse location
cites work: Combination of metaheuristic and exact algorithms for solving set covering-type optimization problems
cites work: Smooth minimization of non-smooth functions
cites work: A hybrid multistart heuristic for the uncapacitated facility location problem
cites work: Solving the uncapacitated facility location problem using tabu search
DOI: 10.1007/S12532-014-0065-Z
description: scientific article; zbMATH DE number 6482770