Connectedness of efficient solutions in multiple criteria combinatorial optimization
From MaRDI portal
Recommendations
- Connectedness of efficient solutions in multiple objective combinatorial optimization
- scientific article; zbMATH DE number 4164571
- On the connectedness of the set of efficient points n convex optimization problems with multiple or random Objectives
- Connectedness of the efficient set for three-objective quasiconcave maximization problems
Cites work
- A revised simplex method for linear multiple objective programs
- A time expanded matroid algorithm for finding optimal dynamic matroid intersections
- Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
- Connectedness in Multiple Linear Fractional Programming
- Connectedness of the set of nondominated outcomes in multicriteria optimization
- On a multicriteria shortest path problem
- On bicriterion minimal spanning trees: An approximation
- On matroids with multiple objectives
- On spanning tree problems with multiple objectives
- On the connectedness of the set of weakly efficient points of a vector optimization problem in locally convex spaces
- Quasiconcave vector maximization: Connectedness of the sets of Pareto- optimal and weak Pareto-optimal alternatives
- The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program
- The set of all nondominated solutions in linear cases and a multicriteria simplex method
Cited in
(29)- Existence and connectedness of solutions for generalized vector quasi-equilibrium problems
- Greedy algorithms for a class of knapsack problems with binary weights
- A note on connectivity of efficient solution sets
- Finding multi-objective supported efficient spanning trees
- Decision space robustness for multi-objective integer linear programming
- Deep reservoir computing
- A multivariate analysis of the strict terminal connection problem
- Algorithm robust for the bicriteria discrete optimization problem
- Stability and accuracy functions in multicriteria linear combinatorial optimization problems
- The biobjective integer minimum cost flow problem -- incorrectness of Sedeño-Noda and Gonzàlez-Martin's algorithm
- Multicriteria scheduling problems: a survey
- The connectedness of the solutions set for generalized vector equilibrium problems
- m/nCCS: linear consecutively connected systems subject to combined gap constraints
- On a particular case of the multi-criteria unconstrained optimization problem
- scientific article; zbMATH DE number 4164571 (Why is no real title available?)
- scientific article; zbMATH DE number 5733494 (Why is no real title available?)
- A Survey on Multiple Objective Minimum Spanning Tree Problems
- Clusters of non-dominated solutions in multiobjective combinatorial optimization: an experimental analysis
- On a biobjective search problem in a line: formulations and algorithms
- On the multicriteria allocation problem
- Finding diverse ways to improve algebraic connectivity through multi-start optimization
- On dominance-based multiobjective local search: design, implementation and experimental analysis on scheduling and traveling salesman problems
- Multi-objective matroid optimization with ordinal weights
- Two‐phase strategies for the bi‐objective minimum spanning tree problem
- A matheuristic for tri-objective binary integer linear programming
- Connectedness of efficient solutions in multiple objective combinatorial optimization
- A GRASP algorithm for the multi-criteria minimum spanning tree problem
- Two-phase Pareto local search for the biobjective traveling salesman problem
- The small world of efficient solutions: empirical evidence from the bi-objective \(\{0,1\}\)-knapsack problem
This page was built for publication: Connectedness of efficient solutions in multiple criteria combinatorial optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1278594)
