Pages that link to "Item:Q632389"
From MaRDI portal
The following pages link to Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods (Q632389):
Displayed 26 items.
- Parallelization of a non-linear multi-objective optimization algorithm: application to a location problem (Q299429) (← links)
- Approximating the Pareto-front of a planar bi-objective competitive facility location and design problem (Q337679) (← links)
- FEMOEA: a fast and efficient multi-objective evolutionary algorithm (Q522100) (← links)
- The multicriteria big cube small cube method (Q611015) (← links)
- Sequential versus simultaneous approach in the location and design of two new facilities using planar Huff-like models (Q960385) (← links)
- A new approach to cooperative competition in facility location problems: mathematical formulations and an approximation algorithm (Q1652288) (← links)
- A triobjective model for locating a public semiobnoxious facility in the plane (Q1666194) (← links)
- Multi-objective branch and bound (Q1753506) (← links)
- A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs (Q1753510) (← links)
- Constraint propagation using dominance in interval branch \& bound for nonlinear biobjective optimization (Q1753511) (← links)
- Nonlinear biobjective optimization: improving the upper envelope using feasible line segments (Q2022248) (← links)
- Nonconvex constrained optimization by a filtering branch and bound (Q2038915) (← links)
- A general branch-and-bound framework for continuous global multiobjective optimization (Q2038927) (← links)
- An approximation algorithm for multi-objective optimization problems using a box-coverage (Q2141729) (← links)
- A geometric branch-and-bound algorithm for the service bundle design problem (Q2160490) (← links)
- Finding non dominated points for multiobjective integer convex programs with linear constraints (Q2162515) (← links)
- Nonlinear biobjective optimization: improvements to interval branch \& bound algorithms (Q2274873) (← links)
- A standard branch-and-bound approach for nonlinear semi-infinite problems (Q2282532) (← links)
- A new scalarization method for finding the efficient frontier in non-convex multi-objective problems (Q2285911) (← links)
- \(\varepsilon\)-Constraint method for bi-objective competitive facility location problem with uncertain demand scenario (Q2308185) (← links)
- A decision space algorithm for multiobjective convex quadratic integer optimization (Q2669498) (← links)
- Verified Methods for Computing Pareto Sets: General Algorithmic Analysis (Q2930551) (← links)
- A new scalarization and numerical method for constructing the weak Pareto front of multi-objective optimization problems (Q3112505) (← links)
- A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization (Q4629343) (← links)
- Mixed-Integer Convex Nonlinear Optimization with Gradient-Boosted Trees Embedded (Q5085481) (← links)
- Twenty years of continuous multiobjective optimization in the twenty-first century (Q6114911) (← links)