An improved branch \& bound method for the uncapacitated competitive location problem
type: Item
instance of: scholarly article
title: An improved branch \& bound method for the uncapacitated competitive location problem
zbMATH Open document ID: 1038.90042
DOI: 10.1023/A:1026182020346
author: Stefano Benati
published in: Annals of Operations Research
publication date: 2003-11-17T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 2005331
zbMATH Keywords: competitive location models
zbMATH Keywords: random utility theory
zbMATH Keywords: submodular functions
zbMATH Keywords: heuristic concentration
zbMATH Keywords: data-correcting method
MaRDI profile type: Publication
full work available at URL: a:1026182020346
OpenAlex ID: W182004018
Recommended article: Q4242550
Recommended article: A branch-and-bound algorithm for the multi-level uncapacitated facility location problem
Recommended article: A branch-and-cut algorithm for a generalization of the uncapacitated facility location problem
Recommended article: Q2993681
Recommended article: Improved Approximation Algorithms for the Uncapacitated Facility Location Problem
Recommended article: A method for solving to optimality uncapacitated location problems
Recommended article: Q4737531
Recommended article: Q3840357
Recommended article: Computing and Combinatorics
Recommended article: An improved approximation algorithm for uncapacitated facility location problem with penalties
description: scientific article; zbMATH DE number 2005331