Using support vector machines to learn the efficient set in multiple objective discrete optimization

DOI10.1016/J.EJOR.2007.09.002MaRDI QIDQ958095zbMATH OpenOpenAlexFDO

Authors Serpil Sayın, Haldun Aytug

Publication date 2 December 2008

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2007.09.002

zbMATH Keywords

machine learningsupport vector machinesmultiple objective optimizationefficient set

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29)

Recommendations

• MOP/GP models for machine learning
• Constrained efficient global optimization with support vector machines
• scientific article; zbMATH DE number 2159077
• Deriving weights in multiple-criteria decision making with support vector machines
• Evolutionary Optimisation of Kernel and Hyper-Parameters for SVM

Cites work

• scientific article; zbMATH DE number 1332320 (Why is no real title available?)
• scientific article; zbMATH DE number 1975070 (Why is no real title available?)
• A survey and annotated bibliography of multiobjective combinatorial optimization
• Genetic Algorithms and Random Keys for Sequencing and Optimization
• Knowledge discovery in a direct marketing case using least squares support vector machines
• Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
• Performance of the MOSA method for the bicriteria assignment problem
• Risk minimization and minimum description for linear discriminant functions
• Solving bicriteria 0--1 knapsack problems using a labeling algorithm.
• Tabu search based procedure for solving the 0-1 multiobjective knapsack problem: The two objectives case
• Text categorization with support vector machines. How to represent texts in input space?
• The multiobjective discrete optimization problem: a weighted min-max two-stage optimization approach and a bicriteria algorithm
• Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem

Cited in

(8)

• Learning Global Optimization Through a Support Vector Machine Based Adaptive Multistart Strategy
• Effective active learning strategies for the use of large-margin classifiers in semantic annotation: an optimal parameter discovery perspective
• Fourier analysis and swarm intelligence for stochastic optimization of discrete functions
• A reduction dynamic programming algorithm for the bi-objective integer knapsack problem
• Optimistic NAUTILUS navigator for multiobjective optimization with costly function evaluations
• Product demand forecasts using wavelet kernel support vector machine and particle swarm optimization in manufacture system
• Constrained efficient global optimization with support vector machines
• Dynamic programming algorithms for the bi-objective integer knapsack problem

Describes a project that uses

Uses Software

• LIBSVM

This page was built for publication: Using support vector machines to learn the efficient set in multiple objective discrete optimization

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