Pages that link to "Item:Q2460136"
From MaRDI portal
The following pages link to Obtaining an outer approximation of the efficient set of nonlinear biobjective problems (Q2460136):
Displaying 20 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)
- A class of problems that can be solved using interval algorithms (Q411419) (← links)
- FEMOEA: a fast and efficient multi-objective evolutionary algorithm (Q522100) (← links)
- The multicriteria big cube small cube method (Q611015) (← links)
- Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods (Q632389) (← 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)
- Bi-objective design-for-control of water distribution networks with global bounds (Q2138314) (← 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)
- Obtaining an outer approximation of the efficient set of nonlinear biobjective problems (Q2460136) (← links)
- Verified Methods for Computing Pareto Sets: General Algorithmic Analysis (Q2930551) (← links)
- From closed-loop to sustainable supply chains: the WEEE case (Q3163212) (← links)
- A survey of interval algorithms for solving multicriteria analysis problems (Q6135498) (← links)
