Pages that link to "Item:Q319674"
From MaRDI portal
The following pages link to On the representation of the search region in multi-objective optimization (Q319674):
Displayed 34 items.
- A multi-criteria approach for hospital capacity analysis (Q323555) (← links)
- Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations (Q724117) (← links)
- Bi-dimensional knapsack problems with one soft constraint (Q1652049) (← links)
- A box decomposition algorithm to compute the hypervolume indicator (Q1652179) (← links)
- Efficient computation of the search region in multi-objective optimization (Q1753505) (← links)
- Multi-objective branch and bound (Q1753506) (← links)
- Constraint propagation using dominance in interval branch \& bound for nonlinear biobjective optimization (Q1753511) (← links)
- An approach to \(\epsilon\)-duality theorems for nonconvex semi-infinite multiobjective optimization problems (Q1990434) (← links)
- Finding a representative nondominated set for multi-objective mixed integer programs (Q1991106) (← links)
- A bicriteria perspective on \(L\)-penalty approaches -- a corrigendum to Siddiqui and Gabriel's \(L\)-penalty approach for solving MPECs (Q2005902) (← links)
- A general branch-and-bound framework for continuous global multiobjective optimization (Q2038927) (← links)
- Half-open polyblock for the representation of the search region in multiobjective optimization problems: its application and computational aspects (Q2040606) (← links)
- New \(\epsilon\)-constraint methods for multi-objective integer linear programming: a Pareto front representation approach (Q2106743) (← links)
- Planning sustainable routes: economic, environmental and welfare concerns (Q2140143) (← links)
- An approximation algorithm for multi-objective optimization problems using a box-coverage (Q2141729) (← links)
- Representing the nondominated set in multi-objective mixed-integer programs (Q2242330) (← links)
- An exact parallel objective space decomposition algorithm for solving multi-objective integer programming problems (Q2274869) (← links)
- Branching with hyperplanes in the criterion space: the frontier partitioner algorithm for biobjective integer programming (Q2286918) (← links)
- A decision space algorithm for multiobjective convex quadratic integer optimization (Q2669498) (← links)
- Split algorithms for multiobjective integer programming problems (Q2669784) (← links)
- Warm-starting lower bound set computations for branch-and-bound algorithms for multi objective integer linear programs (Q2672116) (← links)
- Branch-and-bound and objective branching with three or more objectives (Q2676405) (← links)
- A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization (Q4629343) (← links)
- Enumeration of the Nondominated Set of Multiobjective Discrete Optimization Problems (Q4995057) (← links)
- Network Models for Multiobjective Discrete Optimization (Q5086002) (← links)
- Monomial Tropical Cones for Multicriteria Optimization (Q5112824) (← links)
- Solving Multiobjective Mixed Integer Convex Optimization Problems (Q5131967) (← links)
- A criterion space decomposition approach to generalized tri-objective tactical resource allocation (Q6067194) (← links)
- Effective anytime algorithm for multiobjective combinatorial optimization problems (Q6086280) (← links)
- Ordinal optimization through multi-objective reformulation (Q6096566) (← links)
- Advancements in the computation of enclosures for multi-objective optimization problems (Q6113330) (← links)
- Twenty years of continuous multiobjective optimization in the twenty-first century (Q6114911) (← links)
- Limit sets in global multiobjective optimization (Q6146954) (← links)
- Adaptive piecewise linear relaxations for enclosure computations for nonconvex multiobjective mixed-integer quadratically constrained programs (Q6166099) (← links)