Multicriteria Optimization
From MaRDI portal
Publication:5311858
DOI10.1007/3-540-27659-9zbMath1132.90001MaRDI QIDQ5311858
Publication date: 29 August 2005
Full work available at URL: https://doi.org/10.1007/3-540-27659-9
multiobjective combinatorial optimization; multiobjective simplex method; efficient solution and nondominated point; weighted sum method and scalarization
90C29: Multi-objective and goal programming
90-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming
Related Items
A Polynomial-Time-Delay and Polynomial-Space Algorithm for Enumeration Problems in Multi-criteria Optimization, Multistage Stochastic Programs via Stochastic Parametric Optimization, Mathematical optimization in intensity modulated radiation therapy, Mathematical optimization in intensity modulated radiation therapy, Inverse multi-objective combinatorial optimization, On the number of non-dominated points of a multicriteria optimization problem, Ordered weighted average combinatorial optimization: formulations and their properties, Two phase algorithms for the bi-objective assignment problem, Exact generation of epsilon-efficient solutions in multiple objective programming, On solutions of fuzzy random multiobjective quadratic programming with applications in portfolio problem, Modeling the avian flu, lessons from complex adaptive systems in biology, Finding representative systems for discrete bicriterion optimization problems, A novel elitist multiobjective optimization algorithm: Multiobjective extremal optimization, A computationally efficient algorithm for determination of efficient max-ordering optimal solutions in multiple objective programming, Optimality and mixed saddle point criteria in multiobjective optimization, Deterministic Algorithms for Multi-criteria TSP, Lower Bounds for the Smoothed Number of Pareto Optimal Solutions, Mathematical Optimization Models for WLAN Planning, Unnamed Item, Multi-objective Problems in Terms of Relational Algebra, Unnamed Item, Approximating Multi-criteria Max-TSP, A Survey on Multiple Objective Minimum Spanning Tree Problems, Introducing Nonpolyhedral Cones to Multiobjective Programming, Multiobjective (Combinatorial) Optimisation—Some Thoughts on Applications, Tradeoff analysis for optimal multiobjective inventory model, A variational approach to define robustness for parametric multiobjective optimization problems, Biobjective optimization for analytical target cascading: optimality vs. achievability, Optimal eviction policies for stochastic address traces, On a biobjective search problem in a line: formulations and algorithms, Essential supremum and essential maximum with respect to random preference relations, On approximating weakly/properly efficient solutions in multi-objective programming, Connections between single-level and bilevel multiobjective optimization, Comment to ``Interactive fuzzy goal programming approach for bilevel programming problem by S.R. Arora and R. Gupta, Interactive multiple criteria decision making based on preference driven evolutionary multiobjective optimization with controllable accuracy, On the calculation of a membership function for the solution of a fuzzy linear optimization problem, An outcome space algorithm for optimization over the weakly efficient set of a multiple objective nonlinear programming problem, Criteria and dimension reduction of linear multiple criteria optimization problems, A dual variant of Benson's ``outer approximation algorithm for multiple objective linear programming, Multi-criteria TSP: Min and Max combined, Computational performance of basic state reduction based dynamic programming algorithms for bi-objective 0-1 knapsack problems, Multicriteria analysis based on constructing payoff matrices and applying methods of decision making in fuzzy environment, On constructing total orders and solving vector optimization problems with total orders, An approximation algorithm for convex multi-objective programming problems, Metaheuristics for multiobjective optimisation. Cooperative approaches, uncertainty handling and application in logistics, Solving multi-metric network problems: an interplay between idempotent semiring rules, Sensitivity analysis on the priority of the objective functions in lexicographic multiple objective linear programs, A polynomial-time-delay and polynomial-space algorithm for enumeration problems in multi-criteria optimization, Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods, An optimization modelling for string selection in molecular biology using Pareto optimality, Stopping rules and backward error analysis for bound-constrained optimization, Vectorization of set-valued maps with respect to total ordering cones and its applications to set-valued optimization problems, A review of multiobjective programming and its application in quantitative psychology, Connectedness of efficient solutions in multiple objective combinatorial optimization, Vector optimization problems via improvement sets, Decomposition of generalized vector variational inequalities, A two state reduction based dynamic programming algorithm for the bi-objective \(0\)-\(1\) knapsack problem, Robust possibilistic programming for socially responsible supply chain network design: a new approach, Environmental supply chain network design using multi-objective fuzzy mathematical programming, Deterministic algorithms for multi-criteria max-TSP, Solving optimal control problems by exploiting inherent dynamical systems structures, The generalization of total ordering cones and vectorization to separable Hilbert spaces, The two-stage recombination operator and its application to the multiobjective \(0/1\) knapsack problem: A comparative study, Time-adaptive and history-adaptive multicriterion routing in stochastic, time-dependent networks, On cone characterizations of strong and Lexicographic optimality in convex multiobjective optimization, Plateaus can be harder in multi-objective optimization, A multi-objective programming approach to 1.5-dimensional assortment problem, On globally convergent multi-objective optimization, Expected runtimes of a simple evolutionary algorithm for the multi-objective minimum spanning tree problem, Planar location and design of a new facility with inner and outer competition: an interval lexicographical-like solution procedure, Goal programming in the context of the assignment problem and a computationally effective solution method, Additive and multiplicative tolerance in multiobjective linear programming, Solving efficiently the 0-1 multi-objective knapsack problem, A Levenberg-Marquardt algorithm for unconstrained multicriteria optimization, On fuzzy random multiobjective quadratic programming, Spatial point process models for location-allocation problems, On the robustness of global optima and stationary solutions to stochastic mathematical programs with equilibrium constraints. I: Theory, On the robustness of global optima and stationary solutions to stochastic mathematical programs with equilibrium constraints. II: Applications, Tikhonov-type regularization method for efficient solutions in vector optimization, Linear bilevel programs with multiple objectives at the upper level, Scalar multiplier rules in set-valued optimization, Two-phase Pareto local search for the biobjective traveling salesman problem, Solving bilevel programming problems with multicriteria optimization techniques, Theoretical aspects of multicriteria flight gate scheduling: Deterministic and fuzzy models, Finding non-dominated solutions in bi-objective integer network flow problems, Improved \(\varepsilon\)-constraint method for multiobjective programming, Min-max and min-max regret versions of combinatorial optimization problems: A survey, Approximation algorithms for multi-criteria traveling salesman problems, Implementing an efficient fptas for the 0-1 multi-objective knapsack problem, Computation formulas and multiplier rules for graphical derivatives in separable Banach spaces, DEMORS: A hybrid multi-objective optimization algorithm using differential evolution and rough set theory for constrained problems, Speed-up techniques for solving large-scale biobjective TSP, Labeling algorithms for multiple objective integer knapsack problems, A primal-dual simplex algorithm for bi-objective network flow problems, On the computation of all supported efficient solutions in multi-objective integer network flow problems, Tradeoff-based decomposition and decision-making in multiobjective programming, A multi-objective approach for robust airline scheduling, Complexity of necessary efficiency in interval linear programming and multiobjective linear programming, Approximating the Pareto set of multiobjective linear programs via robust optimization, Greedy algorithms for a class of knapsack problems with binary weights, Exact algorithms for OWA-optimization in multiobjective spanning tree problems, Some heuristic methods for solving \(p\)-median problems with a coverage constraint, On weighting two criteria with a parameter in combinatorial optimization problems, A bi-objective modeling approach applied to an urban semi-desirable facility location problem, Solving nonlinear multi-objective optimization problems with fuzzy relation inequality constraints regarding Archimedean triangular norm compositions, On the calculation of stability radius for multi-objective combinatorial optimization problems by inverse optimization, On the transformation of lexicographic nonlinear multiobjective programs to single objective programs, A supply chain design problem with facility location and bi-objective transportation choices, Balancing of simple assembly lines under variations of task processing times, New optimality conditions for the semivectorial bilevel optimization problem, An objective space cut and bound algorithm for convex multiplicative programmes, Multi-objective integer programming: an improved recursive algorithm, City-courier routing and scheduling problems, Lexicographically-ordered constraint satisfaction problems, Tradeoff oriented solutions in multicriteria optimization, On different aspects of portfolio optimization, Newton-like methods for efficient solutions in vector optimization, A method for generating a well-distributed Pareto set in nonlinear multiobjective optimization, Variational convergence for vector-valued functions and its applications to convex multiobjective optimization, A conic scalarization method in multi-objective optimization, Finding preferred subsets of Pareto optimal solutions, Bounded sets of KKT multipliers in vector optimization, Scheduling two agents on uniform parallel machines with~makespan and cost functions, Parametric LP for sensitivity analysis of efficiency in MOLP problems, Scalarization in geometric and functional vector optimization revisited
