A new algorithm for solving planar multiobjective location problems involving the Manhattan norm
type: Item
instance of: scholarly article
title: A new algorithm for solving planar multiobjective location problems involving the Manhattan norm
zbMATH Open document ID: 1380.90153
author: Shaghaf Alzorba
author: C. Günther
author: Nicolae Popovici
author: Chr. Tammer
published in: European Journal of Operational Research
publication date: 2018-02-16T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C29
zbMATH DE Number: 6839948
zbMATH Keywords: multiple objective programming
zbMATH Keywords: location problem
zbMATH Keywords: Manhattan norm
zbMATH Keywords: scalarization
zbMATH Keywords: nonessential objective
describes a project that uses: Matlab
MaRDI profile type: Publication
full work available at URL: j.ejor.2016.10.045
OpenAlex ID: W2542938963
cites work: A special class of extended multicriteria location problems
cites work: Finding efficient solutions for rectilinear distance location problems efficiently
cites work: Sets of efficient points in a normed space
cites work: Multicriteria Optimization
cites work: On the number of criteria needed to decide Pareto optimality
cites work: Interactive Coordination of Objective Decompositions in Multiobjective Programming
cites work: Nonessential objectives within network approaches for MCDM
cites work: Redundant objective functions in linear vector maximum problems and their determination
cites work: Proper efficiency and the theory of vector maximization
cites work: Dualität und algorithmische anwendung beim vektoriellen standortproblem
cites work: Variational methods in partially ordered spaces
cites work: Vector Optimization
cites work: Q3437868
cites work: Q4203976
cites work: On Efficient Solutions to Multiple Objective Mathematical Programs
cites work: Q5692466
cites work: Multicriteria planar ordered median problems
cites work: Determination of efficient points in multiple-objective location problems
cites work: Pareto reducible multicriteria optimization problems
cites work: Q4944234
cites work: Q5599348
cites work: Structure of Efficient Sets for Convex Objectives
DOI: 10.1016/J.EJOR.2016.10.045
Recommended article: On planar medianoid competitive location problems with Manhattan distance
Recommended article: Multicriteria planar location problems
Recommended article: Q4647987
Recommended article: Q4671510
Recommended article: A robust and efficient algorithm for planar competitive location problems
Recommended article: A general global optimization approach for solving location problems in the plane
Recommended article: A Multi-objective Approach to Solve the Location Areas Problem
Recommended article: Efficient solutions of multicriteria location problems with rectilinear norm in \(\mathbb{R}^3\)
Recommended article: Q4629348
description: scientific article; zbMATH DE number 6839948