Exact solution methods for uncapacitated location problems with convex transportation costs
type: Item
instance of: scholarly article
title: Exact solution methods for uncapacitated location problems with convex transportation costs
zbMATH Open document ID: 0945.90022
DOI: 10.1016/S0377-2217(98)00039-3
author: Kaj Holmberg
published in: European Journal of Operational Research
publication date: 2000-10-11T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 49M27
zbMATH DE Number: 1370716
zbMATH Keywords: location
zbMATH Keywords: dual ascent
zbMATH Keywords: branch-and-bound
zbMATH Keywords: Benders decomposition
MaRDI profile type: Publication
cites work: Lagrangean heuristics for location problems
cites work: Partitioning procedures for solving mixed-variables programming problems
cites work: Q3351135
cites work: A Dual-Based Procedure for Uncapacitated Facility Location
cites work: A dual ascent procedure for the exact formulation of the simple plant location problem with spatial interaction
cites work: Dual search procedures for the exact formulation of the simple plant location problem with spatial interaction
cites work: A production-transportation problem with stochastic demand and concave production costs
cites work: A Modified Benders' Partitioning Algorithm for Mixed Integer Programming
full work available at URL: s0377-2217(98)00039-3
OpenAlex ID: W2049821461
description: scientific article; zbMATH DE number 1370716