Using support vector machines to learn the efficient set in multiple objective discrete optimization
type: Item
instance of: scholarly article
title: Using support vector machines to learn the efficient set in multiple objective discrete optimization
zbMATH Open document ID: 1157.90013
author: Serpil Sayın
author: Haldun Aytug
published in: European Journal of Operational Research
publication date: 2008-12-02T00:00:00Z
Mathematics Subject Classification ID: 90C29
zbMATH DE Number: 5376963
zbMATH Keywords: multiple objective optimization
zbMATH Keywords: efficient set
zbMATH Keywords: machine learning
zbMATH Keywords: support vector machines
describes a project that uses: LIBSVM
MaRDI profile type: Publication
full work available at URL: j.ejor.2007.09.002
OpenAlex ID: W2080714465
cites work: Risk minimization and minimum description for linear discriminant functions
cites work: Genetic Algorithms and Random Keys for Sequencing and Optimization
cites work: Solving bicriteria 0--1 knapsack problems using a labeling algorithm.
cites work: A survey and annotated bibliography of multiobjective combinatorial optimization
cites work: Tabu search based procedure for solving the 0-1 multiobjective knapsack problem: The two objectives case
cites work: Q4424281
cites work: Text categorization with support vector machines. How to represent texts in input space?
cites work: Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
cites work: The Multiobjective Discrete Optimization Problem: A Weighted Min-Max Two-Stage Optimization Approach and a Bicriteria Algorithm
cites work: Performance of the MOSA method for the bicriteria assignment problem
cites work: Q4261789
cites work: Knowledge discovery in a direct marketing case using least squares support vector machines
cites work: Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
DOI: 10.1016/J.EJOR.2007.09.002
description: scientific article; zbMATH DE number 5376963