scientific article; zbMATH DE number 2209474

Margaret M. Wiecek, Matthias Ehrgott

Publication date: 28 September 2005

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Multi-objective and goal programming (90C29) Management decision making, including multiple objectives (90B50)

Related Items (48)

A Benson-type algorithm for bounded convex vector optimization problems with vertex selection ⋮ A combined scalarizing method for multiobjective programming problems ⋮ A fuzzy optimization approach for procurement transport operational planning in an automobile supply chain ⋮ An improved algorithm for solving biobjective integer programs ⋮ A bicriterion algorithm for the allocation of cross-trained workers based on operational and human resource objectives ⋮ Quadratic scalarization for decomposed multiobjective optimization ⋮ ILP heuristics and a new exact method for bi-objective 0/1 ILPs: application to fttx-network design ⋮ A conic scalarization method in multi-objective optimization ⋮ Finding non dominated points for multiobjective integer convex programs with linear constraints ⋮ On the quality of discrete representations in multiple objective programming ⋮ A Benson type algorithm for nonconvex multiobjective programming problems ⋮ Biobjective optimization for analytical target cascading: optimality vs. achievability ⋮ A numerical method for constructing the Pareto front of multi-objective optimization problems ⋮ Sublinear scalarizations for proper and approximate proper efficient points in nonconvex vector optimization ⋮ Identifying preferred solutions to multi-objective binary optimisation problems, with an application to the multi-objective knapsack problem ⋮ Multiobjective Programming and Multiattribute Utility Functions in Portfolio Optimization ⋮ An Epsilon Constraint Method for selecting Indicators for use in Neural Networks for Stock Market Forecasting ⋮ Joint chance-constrained multi-objective multi-commodity minimum cost network flow problem with copula theory ⋮ Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods ⋮ A dual variant of Benson's ``outer approximation algorithm for multiple objective linear programming ⋮ Generating equidistant representations in biobjective programming ⋮ A review of multiobjective programming and its application in quantitative psychology ⋮ Multiobjective blockmodeling for social network analysis ⋮ A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation ⋮ Obtaining an outer approximation of the efficient set of nonlinear biobjective problems ⋮ Primal-dual simplex method for multiobjective linear programming ⋮ Using multiobjective mathematical programming to link national competitiveness, productivity, and innovation ⋮ A coverage-based box-algorithm to compute a representation for optimization problems with three objective functions ⋮ Covers and approximations in multiobjective optimization ⋮ A multi-objective, hub-and-spoke model to design and manage biofuel supply chains ⋮ Approximately solving multiobjective linear programmes in objective space and an application in radiotherapy treatment planning ⋮ An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits ⋮ On Gradient-Based Local Search to Hybridize Multi-objective Evolutionary Algorithms ⋮ A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs ⋮ Variable preference modeling with ideal-symmetric convex cones ⋮ An approximation algorithm for convex multi-objective programming problems ⋮ Lexicographically-ordered constraint satisfaction problems ⋮ Two-group classification via a biobjective margin maximization model ⋮ Comparison of some scalarization methods in multiobjective optimization ⋮ Number of bins and maximum lateness minimization in two-dimensional bin packing ⋮ Approximating the nondominated set of an MOLP by approximately solving its dual problem ⋮ A semidefinite programming approach for solving multiobjective linear programming ⋮ Improved \(\varepsilon\)-constraint method for multiobjective programming ⋮ Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems ⋮ Introducing Nonpolyhedral Cones to Multiobjective Programming ⋮ A primal-dual simplex algorithm for bi-objective network flow problems ⋮ Tradeoff-based decomposition and decision-making in multiobjective programming ⋮ Approximation methods in multiobjective programming

This page was built for publication: