Quantitative comparison of approximate solution sets for multicriteria optimization problems with weighted Tchebycheff preference function

DOI10.1287/OPRE.1090.0766zbMATH Open1228.90105OpenAlexW2103640719MaRDI QIDQ3098263FDOQ3098263

Authors: Bilge Bozkurt, John Fowler, Esma S. Gel, Bosun Kim, Jyrki Wallenius, Murat Köksalan 

Publication date: 17 November 2011

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.1090.0766

Recommendations

• Evaluating solutions and solution sets under multiple objectives
• Evaluation of nondominated solution sets for \(k\)-objective optimization problems: an exact method and approximations
• Evaluating solution sets of a posteriori solution techniques for bi-criteria combinatorial optimization problems
• Analytical Evaluation of Multi-Criteria Heuristics
• scientific article; zbMATH DE number 3932804

zbMATH Keywords

multiple objective combinatorial optimizationTchebycheff functionmultiple criteria metaheuristics

Mathematics Subject Classification ID

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

Cited In (11)

• Title not available (Why is that?)
• A criterion space search algorithm for mixed integer linear maximum multiplicative programs: a multiobjective optimization approach
• An augmented weighted Tchebycheff method with adaptively chosen parameters for discrete bicriteria optimization problems
• A radial boundary intersection aided interior point method for multi-objective optimization
• Methods of Tropical Optimization in Rating Alternatives Based on Pairwise Comparisons
• Analysis of the weighted Tchebycheff weight set decomposition for multiobjective discrete optimization problems
• Evaluating solution sets of a posteriori solution techniques for bi-criteria combinatorial optimization problems
• The weighted \(p\)-norm weight set decomposition for multiobjective discrete optimization problems
• Evaluation of nondominated solution sets for \(k\)-objective optimization problems: an exact method and approximations
• Interactive algorithms for a broad underlying family of preference functions
• Evaluating solutions and solution sets under multiple objectives

This page was built for publication: Quantitative comparison of approximate solution sets for multicriteria optimization problems with weighted Tchebycheff preference function

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