Connectedness of efficient solutions in multiple criteria combinatorial optimization
type: Item
instance of: scholarly article
title: Connectedness of efficient solutions in multiple criteria combinatorial optimization
zbMATH Open document ID: 0923.90127
DOI: 10.1016/S0377-2217(96)00116-6
author: Kathrin Klamroth
author: Matthias Ehrgott
published in: European Journal of Operational Research
publication date: 1999-02-22T00:00:00Z
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 1253154
zbMATH Keywords: multiple criteria optimization
zbMATH Keywords: efficient solutions
zbMATH Keywords: connectedness for discrete optimization problems
zbMATH Keywords: spanning tree
MaRDI profile type: Publication
cites work: On bicriterion minimal spanning trees: An approximation
cites work: Connectedness in Multiple Linear Fractional Programming
cites work: On matroids with multiple objectives
cites work: A revised simplex method for linear multiple objective programs
cites work: A time expanded matroid algorithm for finding optimal dynamic matroid intersections
cites work: On spanning tree problems with multiple objectives
cites work: On the connectedness of the set of weakly efficient points of a vector optimization problem in locally convex spaces
cites work: The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program
cites work: On a multicriteria shortest path problem
cites work: Connectedness of the set of nondominated outcomes in multicriteria optimization
cites work: Quasiconcave vector maximization: Connectedness of the sets of Pareto- optimal and weak Pareto-optimal alternatives
cites work: Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
cites work: The set of all nondominated solutions in linear cases and a multicriteria simplex method
full work available at URL: s0377-2217(96)00116-6
OpenAlex ID: W1991632843
description: scientific article; zbMATH DE number 1253154