scientific article; zbMATH DE number 1858037

zbMATH Open1027.90081MaRDI QIDQ4789008FDOQ4789008

Authors: Andrzej Jaszkiewicz 

Publication date: 22 January 2003

Title of this publication is not available (Why is that?)

Recommendations

• On the computational efficiency of multiple objective metaheuristics. The knapsack problem case study
• Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
• scientific article; zbMATH DE number 1086965
• Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors.
• Interactive multiobjective optimization with the Pareto memetic algorithm

zbMATH Keywords

metaheuristicsmultiple objective optimizationinteractive methodscomputational effectivenessscalarizing functions

Mathematics Subject Classification ID

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

Cited In (6)

• Comparative analysis of multi-objective metaheuristic algorithms by means of performance metrics to continuous problems
• Title not available (Why is that?)
• Experiments concerning sequential versus simultaneous maximization of objective function and distance
• State space modeling \& Bayesian inference with computational intelligence
• Evaluation of nondominated solution sets for \(k\)-objective optimization problems: an exact method and approximations
• On the computational efficiency of multiple objective metaheuristics. The knapsack problem case study

Uses Software

• TSPLIB

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 Q4789008)