A coverage-based box-algorithm to compute a representation for optimization problems with three objective functions

DOI10.1007/S10898-016-0425-5zbMATH Open1366.90190OpenAlexW2321437985MaRDI QIDQ513166FDOQ513166

Stefan Ruzika, Tobias Kuhn

Publication date: 3 March 2017

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: http://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/3911

Recommendations

• An approximation algorithm for multi-objective optimization problems using a box-coverage
• An algorithm for solving convex programs subject to box constraints
• Covers and approximations in multiobjective optimization
• A spectral approach to solve box-constrained multi-objective optimization problems
• A new algorithm for box-constrained global optimization
• The cubic algorithm for global optimization with box and equality constraints and application to the optimal allocation of resources
• MAPLE code of the cubic algorithm for multiobjective optimization with box constraints
• A New Active Set Algorithm for Box Constrained Optimization
• A piecewise convexification method for non-convex multi-objective optimization programs with box constraints
• Algorithms and Computation

zbMATH Keywords

approximationefficient solutionmultiple objective optimizationcoverage errorbox-algorithmrepresentation systems

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Nonlinear multiobjective optimization
• Computation of ideal and Nadir values and implications for their use in MCDM methods.
• Multicriteria Optimization
• Title not available (Why is that?)
• A survey and annotated bibliography of multiobjective combinatorial optimization
• An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
• Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
• A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems
• A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems
• \(K\)-PPM: a new exact method to solve multi-objective combinatorial optimization problems
• Finding representative systems for discrete bicriterion optimization problems
• Approximation methods in multiobjective programming
• The \(L\)-shape search method for triobjective integer programming
• Title not available (Why is that?)
• Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors.
• Title not available (Why is that?)
• An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming
• A robust bus evacuation model with delayed scenario information
• Branch and bound algorithms for the bus evacuation problem
• Towards finding global representations of the efficient set in multiple objective mathematical programming
• Title not available (Why is that?)
• The Triangle Splitting Method for Biobjective Mixed Integer Programming

Cited In (5)

• An approximation algorithm for multi-objective optimization problems using a box-coverage
• Equidistant representations: connecting coverage and uniformity in discrete biobjective optimization
• An approach to generate comprehensive piecewise linear interpolation of Pareto outcomes to aid decision making
• Representing the nondominated set in multi-objective mixed-integer programs
• Generating representative sets for multiobjective discrete optimization problems with specified coverage errors

This page was built for publication: A coverage-based box-algorithm to compute a representation for optimization problems with three objective functions

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