Pages that link to "Item:Q476260"

The following pages link to A one-step worst-case optimal algorithm for bi-objective univariate optimization (Q476260):

Displayed 9 items.

• Bi-objective hypervolume-based Pareto optimization (Q497433) ‎ (← links)
• Derivative-free local tuning and local improvement techniques embedded in the univariate global optimization (Q727229) ‎ (← links)
• Visualization of a statistical approximation of the Pareto front (Q1732235) ‎ (← links)
• On the extension of the \textsc{direct} algorithm to multiple objectives (Q2022240) ‎ (← links)
• A branch and bound algorithm for Holder bi-objective optimization. Implementation to multidimensional optimization (Q2095643) ‎ (← links)
• An approximation algorithm for multi-objective optimization problems using a box-coverage (Q2141729) ‎ (← links)
• On one-step worst-case optimal trisection in univariate bi-objective Lipschitz optimization (Q2199619) ‎ (← links)
• A new trisection method for solving Lipschitz bi-objective optimization problems (Q2666322) ‎ (← links)
• Branch and probability bound methods in multi-objective optimization (Q5963235) ‎ (← links)