The Multiobjective Discrete Optimization Problem: A Weighted Min-Max Two-Stage Optimization Approach and a Bicriteria Algorithm

Authors:
Serpil Sayin;Panos Kouvelis
Affiliations:
College of Administrative Sciences and Economics, Koç University, Sariyer, Istanbul, 34450 Turkey;Olin School of Business, Washington University, 1 Brookings Drive, St. Louis, Missouri 63130
Venue:
Management Science
Year:
2005

Citing 5
Cited 3

A modified weighted Tchebycheff metric for multiple objective programming

Computers and Operations Research
Performance of the MOSA Method for the Bicriteria Assignment Problem

Journal of Heuristics
Two-phases Method and Branch and Bound Procedures to Solve the Bi–objective Knapsack Problem

Journal of Global Optimization
Solving bicriteria 0-1 knapsack problems using a labeling algorithm

Computers and Operations Research
An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming

Operations Research Letters

Using SVM to learn the efficient set in multiple objective discrete optimization

FSKD'09 Proceedings of the 6th international conference on Fuzzy systems and knowledge discovery - Volume 6
Generating equidistant representations in biobjective programming

Computational Optimization and Applications
Finding representative systems for discrete bicriterion optimization problems

Operations Research Letters

Quantified Score

Hi-index	0.01

Visualization

Abstract

Consumers purchase conspicuous goods to satisfy not only material needs but also social needs such as prestige. In an attempt to meet these social needs, producers of conspicuous goods like cars, perfumes, and watches, highlight the exclusivity of their ...