Pages that link to "Item:Q1753505"
From MaRDI portal
The following pages link to Efficient computation of the search region in multi-objective optimization (Q1753505):
Displaying 26 items.
- Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations (Q724117) (← links)
- A box decomposition algorithm to compute the hypervolume indicator (Q1652179) (← links)
- Linear programming-based directed local search for expensive multi-objective optimization problems: application to drinking water production plants (Q1754046) (← links)
- Preprocessing and cut generation techniques for multi-objective binary programming (Q1755381) (← links)
- A bicriteria perspective on \(L\)-penalty approaches -- a corrigendum to Siddiqui and Gabriel's \(L\)-penalty approach for solving MPECs (Q2005902) (← links)
- Multi-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programs (Q2027064) (← links)
- Performance indicators in multiobjective optimization (Q2030589) (← 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)
- Distribution based representative sets for multi-objective integer programs (Q2178085) (← links)
- Representing the nondominated set in multi-objective mixed-integer programs (Q2242330) (← links)
- Efficient computation of expected hypervolume improvement using box decomposition algorithms (Q2274866) (← 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)
- FPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programming (Q2329715) (← links)
- Computing representations using hypervolume scalarizations (Q2669609) (← links)
- Split algorithms for multiobjective integer programming problems (Q2669784) (← links)
- Enumeration of the Nondominated Set of Multiobjective Discrete Optimization Problems (Q4995057) (← links)
- Monomial Tropical Cones for Multicriteria Optimization (Q5112824) (← 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)
- 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)
- Adaptive piecewise linear relaxations for enclosure computations for nonconvex multiobjective mixed-integer quadratically constrained programs (Q6166099) (← links)
- Finding preferred solutions under weighted Tchebycheff preference functions for multi-objective integer programs (Q6167407) (← links)