Methods for a class of discrete location problems
type: Item
instance of: scholarly article
title: Methods for a class of discrete location problems
zbMATH Open document ID: 0583.90020
DOI: 10.1080/02331938508843052
author: Ivan Martinec
published in: Optimization
publication date: 1985-01-01T00:00:00Z
Mathematics Subject Classification ID: 90B05
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 3934725
zbMATH Keywords: integer linear programming
zbMATH Keywords: implicit enumeration method
zbMATH Keywords: approximate methods
zbMATH Keywords: \(\epsilon \) -optimal solutions
zbMATH Keywords: uncapacitated plant location
zbMATH Keywords: two-state location problems
MaRDI profile type: MaRDI publication profile
full work available at URL: https://doi.org/10.1080/02331938508843052
OpenAlex ID: W1995428829
cites work: A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
cites work: An Efficient Branch and Bound Algorithm for the Warehouse Location Problem
cites work: Q4077727
cites work: Technical Note—A Flexible Tree-Search Method for Integer Programming Problems
Recommended article: Q3763867
Recommended article: The plant location problem with discrete capacities and indivisible customers
Recommended article: Lösungsverfahren für eine klasse diskreter optimierungsaufgaben spezieller struktur
Recommended article: Approximation of solutions for location problems
Recommended article: Q5688514
description: scientific article