Pages that link to "Item:Q1240665"
From MaRDI portal
The following pages link to Connectedness of the set of nondominated outcomes in multicriteria optimization (Q1240665):
Displaying 50 items.
- Connectedness of efficient solutions in multiple objective combinatorial optimization (Q650207) (← links)
- Connectedness of cone-efficient solution set for cone-quasiconvex multiobjective programming in locally convex spaces (Q705084) (← links)
- Maximal points with respect to cone dominance in Banach spaces and their existence (Q787438) (← links)
- Geometric consideration of duality in vector optimization (Q790718) (← links)
- On essential sets and essential components of efficient solutions for vector optimization problems (Q819055) (← links)
- Solving the linear multiple choice knapsack problem with two objectives: Profit and equity (Q839491) (← links)
- Multiple objective minimum cost flow problems: a review (Q853016) (← links)
- On connectedness of efficient solution sets for a star cone-quasiconvex vector optimization problem (Q871672) (← links)
- On Pareto optima, the Fermat-Weber problem, and polyhedral gauges (Q918867) (← links)
- Variable preference modeling with ideal-symmetric convex cones (Q960117) (← links)
- Images of connected sets by semicontinuous multifunctions (Q1066501) (← links)
- On efficient sets in vector maximum problems - A brief survey (Q1068004) (← links)
- Stability in vector maximization - a survey (Q1074503) (← links)
- Weighting factor results in vector optimization (Q1093548) (← links)
- Characterizing the nondominated set by separable functions (Q1093551) (← links)
- On the image of a constrained extremum problem and some applications to the existence of a minimum (Q1095039) (← links)
- Some topological properties in optimization theory (Q1095046) (← links)
- On the structure and properties of a linear multilevel programming problem (Q1095807) (← links)
- On the connectedness of the set of weakly efficient points of a vector optimization problem in locally convex spaces (Q1121804) (← links)
- Stability in multicriteria optimization (Q1131961) (← links)
- Some results about nondominated solutions (Q1148817) (← links)
- Bicriteria linear fractional programming (Q1148820) (← links)
- Properly efficient and efficient solutions for vector maximization problems in Euclidean space (Q1159137) (← links)
- On a domination property for vector maximization with respect to cones (Q1161684) (← links)
- Some minimax theorems in vector-valued functions (Q1169410) (← links)
- Quasiconcave vector maximization: Connectedness of the sets of Pareto- optimal and weak Pareto-optimal alternatives (Q1170115) (← links)
- Connectedness of the efficient set of strictly quasiconcave sets (Q1264975) (← links)
- On the quasiconcave bilevel programming problem (Q1273913) (← links)
- Connectedness of efficient solutions in multiple criteria combinatorial optimization (Q1278594) (← links)
- Connectedness of the efficient set in strictly quasiconcave vector maximization (Q1321396) (← links)
- Connectedness of efficient solution sets for set-valued maps in normed spaces (Q1337208) (← links)
- Connectedness of the efficient set for three-objective quasiconcave maximization problems (Q1357522) (← links)
- The balance space approach to multicriteria decision making -- involving the decision maker. (Q1416298) (← links)
- Contractibility and connectedness of efficient point sets (Q1573996) (← links)
- Arcwise connectedness of closed efficient point sets (Q1576943) (← links)
- A multiobjective hub-airport location problem for an airline network design (Q1737476) (← links)
- Discrete representation of non-dominated sets in multi-objective linear programming (Q1751259) (← links)
- The search-and-remove algorithm for biobjective mixed-integer linear programming problems (Q1754323) (← links)
- A geometrical analysis of the efficient outcome set in multiple objective convex programs with linear criterion functions (Q1892603) (← links)
- A note on connectivity of efficient solution sets (Q1924584) (← links)
- Topological properties of Henig globally efficient solutions of set-valued problems (Q2260232) (← links)
- Meilleure approximation en norme vectorielle et théorie de la localisation (Q3794670) (← links)
- Pareto efficiency in locally convex spaces i (Q3816593) (← links)
- Connectedness of the efficient solution sets for a strictly path quasiconvex programming problem (Q4291623) (← links)
- Connectivity of efficient solution sets in vector optimization of set-valued mappings (Q4331988) (← links)
- Filtering Algorithms for Biobjective Mixed Binary Linear Optimization Problems with a Multiple-Choice Constraint (Q5139847) (← links)
- Connectedness of efficient points in convex and convex transformable vector optimization (Q5466710) (← links)
- Contractibility of efficient point sets in normed spaces (Q5750726) (← links)
- Optimization over the efficient set (Q5896268) (← links)
- Generalized convexity in multiobjective programming (Q5906377) (← links)
