Pages that link to "Item:Q2581275"

The following pages link to Efficiently computing succinct trade-off curves (Q2581275):

Displaying 19 items.

• Efficient optimization of many objectives by approximation-guided evolution (Q319124) (← links)
• Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits (Q336534) (← links)
• Covers and approximations in multiobjective optimization (Q513168) (← links)
• Discrete representation of the non-dominated set for multi-objective optimization problems using kernels (Q1753501) (← links)
• Reference points and approximation algorithms in multicriteria discrete optimization (Q1753504) (← links)
• Approximate Pareto sets of minimal size for multi-objective optimization problems (Q1785308) (← links)
• One-exact approximate Pareto sets (Q2038919) (← links)
• The power of the weighted sum scalarization for approximating multiobjective optimization problems (Q2075396) (← links)
• An approximation algorithm for a general class of multi-parametric optimization problems (Q2082173) (← links)
• Approximate tradeoffs on weighted labeled matroids (Q2341761) (← links)
• Decision-making based on approximate and smoothed Pareto curves (Q2371803) (← links)
• A general approximation method for bicriteria minimization problems (Q2402670) (← links)
• How Good is the Chord Algorithm? (Q2816293) (← links)
• An adaptive patch approximation algorithm for bicriteria convex mixed-integer problems (Q5055294) (← links)
• On Geometric Set Cover for Orthants (Q5075763) (← links)
• Approximation Methods for Multiobjective Optimization Problems: A Survey (Q5084597) (← links)
• A Criterion Space Method for Biobjective Mixed Integer Programming: The Boxed Line Method (Q5139845) (← links)
• The smoothed number of Pareto-optimal solutions in bicriteria integer optimization (Q6044982) (← links)
• Approximating biobjective minimization problems using general ordering cones (Q6162511) (← links)