Locating a semi-obnoxious facility in the special case of Manhattan distances
type: Item
instance of: scholarly article
title: Locating a semi-obnoxious facility in the special case of Manhattan distances
zbMATH Open document ID: 1427.90196
author: Andrea Wagner
published in: Mathematical Methods of Operations Research
publication date: 2019-11-27T00:00:00Z
Mathematics Subject Classification ID: 90B85
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C46
zbMATH DE Number: 7137168
zbMATH Keywords: obnoxious facility location
zbMATH Keywords: global optimization
zbMATH Keywords: primal and dual algorithms
zbMATH Keywords: dc problems
describes a project that uses: BENSOLVE
MaRDI profile type: Publication
full work available at URL: s00186-019-00671-z
OpenAlex ID: W2945554397
cites work: An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
cites work: Q4265879
cites work: A Maxmin Location Problem
cites work: The Weber Problem On The Plane With Some Negative Weights
cites work: DC programming: overview.
cites work: Solving DC programs with a polyhedral component utilizing a multiple objective linear programming solver
cites work: The vector linear program solver Bensolve -- notes on theoretical background
cites work: Equivalence between polyhedral projection, multiple objective linear programming and vector linear programming
cites work: Weber's problem with attraction and repulsion under polyhedral gauges
cites work: Q4367080
cites work: Q4235027
cites work: A Fenchel-Rockafellar type duality theorem for maximization
cites work: Duality for nonconvex approximation and optimization.
cites work: Duality in nonconvex optimization
cites work: Convex analysis and global optimization
cites work: Q3179426
Wikidata QID: Q127866348
DOI: 10.1007/S00186-019-00671-Z
description: scientific article; zbMATH DE number 7137168