Pages that link to "Item:Q2583199"
From MaRDI portal
The following pages link to Approximation methods in multiobjective programming (Q2583199):
Displaying 50 items.
- A combined scalarizing method for multiobjective programming problems (Q299884) (← links)
- Inverse DEA with frontier changes for new product target setting (Q323375) (← links)
- On finding representative non-dominated points for bi-objective integer network flow problems (Q337035) (← links)
- Representation of the non-dominated set in biobjective discrete optimization (Q342058) (← links)
- On the quality of discrete representations in multiple objective programming (Q374696) (← links)
- Generating equidistant representations in biobjective programming (Q429518) (← links)
- Primal and dual approximation algorithms for convex vector optimization problems (Q475807) (← links)
- A note on optimality conditions for multi-objective problems with a Euclidean cone of preferences (Q495727) (← links)
- A coverage-based box-algorithm to compute a representation for optimization problems with three objective functions (Q513166) (← links)
- Covers and approximations in multiobjective optimization (Q513168) (← links)
- Constructing a Pareto front approximation for decision making (Q532529) (← links)
- An approximation algorithm for convex multi-objective programming problems (Q548180) (← links)
- Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods (Q632389) (← links)
- The Pareto-optimal solution set of the equilibrium network design problem with multiple commensurate objectives (Q651306) (← links)
- PAINT: Pareto front interpolation for nonlinear multiobjective optimization (Q694527) (← links)
- An exact scalarization method with multiple reference points for bi-objective integer linear optimization problems (Q828841) (← links)
- Certainty equivalent and utility indifference pricing for incomplete preferences via convex vector optimization (Q829338) (← links)
- Scalarizations for adaptively solving multi-objective optimization problems (Q849089) (← links)
- On continuation methods for non-linear bi-objective optimization: towards a certified interval-based approach (Q905750) (← links)
- Generating the weakly efficient set of nonconvex multiobjective problems (Q934803) (← links)
- Multiobjective bilevel optimization (Q964179) (← links)
- Approximating the nondominated set of an MOLP by approximately solving its dual problem (Q999127) (← links)
- New multi-objective method to solve reentrant hybrid flow shop scheduling problem (Q1043329) (← links)
- On upper approximations of Pareto fronts (Q1630272) (← links)
- Constructing the Pareto front for multi-objective Markov chains handling a strong Pareto policy approach (Q1655397) (← links)
- Necessary and sufficient conditions for Pareto efficiency in robust multiobjective optimization (Q1683101) (← links)
- Interactive \textsc{Nonconvex Pareto Navigator} for multiobjective optimization (Q1711468) (← links)
- Discrete representation of non-dominated sets in multi-objective linear programming (Q1751259) (← links)
- Discrete representation of the non-dominated set for multi-objective optimization problems using kernels (Q1753501) (← links)
- Multi-objective branch and bound (Q1753506) (← links)
- Cooperative multiobjective optimization with bounds on objective functions (Q2022239) (← links)
- A general branch-and-bound framework for continuous global multiobjective optimization (Q2038927) (← links)
- Bounds on efficient outcomes for large-scale cardinality-constrained Markowitz problems (Q2046267) (← links)
- An approximation algorithm for multi-objective optimization problems using a box-coverage (Q2141729) (← links)
- A norm minimization-based convex vector optimization algorithm (Q2156397) (← links)
- Numerical solution of an obstacle problem with interval coefficients (Q2178955) (← links)
- City-courier routing and scheduling problems (Q2253369) (← links)
- Pareto navigator for interactive nonlinear multiobjective optimization (Q2267383) (← links)
- A mesh adaptive direct search algorithm for multiobjective optimization (Q2267660) (← links)
- Designing flexible loop-based material handling AGV paths with cell-adjacency priorities: an efficient cutting-plane algorithm (Q2283932) (← links)
- \texttt{PAINT-SICon}: constructing consistent parametric representations of Pareto sets in nonconvex multiobjective optimization (Q2349520) (← links)
- A method for generating a well-distributed Pareto set in nonlinear multiobjective optimization (Q2378257) (← links)
- An improved algorithm for solving biobjective integer programs (Q2379864) (← links)
- An approach to generate comprehensive piecewise linear interpolation of Pareto outcomes to aid decision making (Q2397433) (← links)
- A Benson type algorithm for nonconvex multiobjective programming problems (Q2408519) (← links)
- NAUTILUS navigator: free search interactive multiobjective optimization without trading-off (Q2423802) (← links)
- On Pareto optimality conditions in the case of two-dimension non-convex utility space (Q2450747) (← links)
- Exact generation of epsilon-efficient solutions in multiple objective programming (Q2460074) (← links)
- Obtaining an outer approximation of the efficient set of nonlinear biobjective problems (Q2460136) (← links)
- Finding representative systems for discrete bicriterion optimization problems (Q2467474) (← links)
