Quantitative Comparison of Approximate Solution Sets for Multicriteria Optimization Problems with Weighted Tchebycheff Preference Function
From MaRDI portal
Publication:3098263
DOI10.1287/opre.1090.0766zbMath1228.90105MaRDI QIDQ3098263
Esma S. Gel, John W. Fowler, Bosun Kim, Bilge Bozkurt, Jyrki Wallenius, Murat M. 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
multiple objective combinatorial optimization; Tchebycheff function; multiple criteria metaheuristics
90C29: Multi-objective and goal programming
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
Related Items
A criterion space search algorithm for mixed integer linear maximum multiplicative programs: a multiobjective optimization approach, Analysis of the weighted Tchebycheff weight set decomposition for multiobjective discrete optimization problems, An augmented weighted Tchebycheff method with adaptively chosen parameters for discrete bicriteria optimization problems, Interactive algorithms for a broad underlying family of preference functions, Evaluating solutions and solution sets under multiple objectives, A radial boundary intersection aided interior point method for multi-objective optimization
