Pages that link to "Item:Q2038927"
From MaRDI portal
The following pages link to A general branch-and-bound framework for continuous global multiobjective optimization (Q2038927):
Displaying 19 items.
- Target-oriented branch and bound method for global optimization (Q1422887) (← links)
- Multi-objective branch and bound (Q1753506) (← links)
- Generalized target-allocation functions and their evaluation by the branch-and-bound method (Q2130723) (← links)
- An approximation algorithm for multi-objective optimization problems using a box-coverage (Q2141729) (← links)
- A multiobjective branch-and-bound framework: application to the biobjective spanning tree problem (Q2901028) (← links)
- A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization (Q4629343) (← links)
- A Criterion Space Branch-and-Cut Algorithm for Mixed Integer Bilinear Maximum Multiplicative Programs (Q5087716) (← links)
- B&B method for discrete partial order and quasiorder optimizations (Q5383041) (← links)
- Branch and probability bound methods in multi-objective optimization (Q5963235) (← 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)
- Reference-point-based branch and bound algorithm for multiobjective optimization (Q6203550) (← links)
- On the relationship between the value function and the efficient frontier of a mixed integer linear optimization problem (Q6616276) (← links)
- A hybrid patch decomposition approach to compute an enclosure for multi-objective mixed-integer convex optimization problems (Q6616279) (← links)
- On necessary optimality conditions for sets of points in multiobjective optimization (Q6636780) (← links)
- A solver for multiobjective mixed-integer convex and nonconvex optimization (Q6644257) (← links)
- Uniform weak sharp minima for multiobjective optimization problems (Q6658289) (← links)
- Designing sustainable diet plans by solving triobjective integer programs (Q6659488) (← links)
