scientific article; zbMATH DE number 6678440

DOI10.4230/LIPICS.FSTTCS.2012.58MaRDI QIDQ2957481zbMATH OpenFDO

Authors Navin Goyal, Luis Rademacher

Publication date 26 January 2017

zbMATH Keywords

knapsack problemmultiobjective optimizationgeometric probabilityPareto optimumsmoothed analysis

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Integer programming (90C10)

Recommendations

• Lower bounds for the average and smoothed number of Pareto-optima
• Lower bounds for the smoothed number of Pareto optimal solutions
• The smoothed number of Pareto-optimal solutions in non-integer bicriteria optimization
• The smoothed number of Pareto-optimal solutions in bicriteria integer optimization
• The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization
• scientific article; zbMATH DE number 3932809
• On lower and upper bounds in smooth and strongly convex optimization
• Approximation of a set of Pareto-optimal solutions
• Smooth optimization algorithms for optimizing over the Pareto efficient set and their applications to minmax flow problems
• On the Pareto optimality in the context of Lipschitzian optimization

Cited in

(4)

• The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization
• Lower bounds for the average and smoothed number of Pareto-optima
• Lower bounds for the smoothed number of Pareto optimal solutions
• Statistics of partial minima

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2957481)