Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Approaches for discrete alternative multiple criteria decision making for monotonic utility functions
Download
035617.pdf
Date
1994
Author
Tehneldere, Muhteşem
Metadata
Show full item record
Item Usage Stats
53
views
0
downloads
Cite This
URI
https://hdl.handle.net/11511/9949
Collections
Graduate School of Natural and Applied Sciences, Thesis
Suggestions
OpenMETU
Core
Approaches for discrete alternative multiple criteria problems for different types of criteria
Köksalan, Murat; Karwan, Mark H.; Zionts, Stanley (Informa UK Limited, 1986-9)
Approaches for special multiobjective combinatorial optimization problems with side constraints
Akın, Banu; Köksalan, Murat; Department of Industrial Engineering (2012)
We propose a generic algorithm based on branch-and-bound to generate all efficient solutions of multiobjective combinatorial optimization (MOCO) problems. We present an algorithm specific to multiobjective 0-1 Knapsack Problem based on the generic algorithm. We test the performance of our algorithm on randomly generated sample problems against IBM ILOG CPLEX and we obtain better performance using a problem specific algorithm. We develop a heuristic algorithm by incorporating memory limitations at the expens...
Approaches for multiobjective combinatorial optimization problems
Özpeynirci, Nail Özgür; Köksalan, Murat; Department of Industrial Engineering (2008)
In this thesis, we consider multiobjective combinatorial optimization problems. We address two main topics. We first address the polynomially solvable cases of the Traveling Salesperson Problem and the Bottleneck Traveling Salesperson Problem. We consider multiobjective versions of these problems with different combinations of objective functions, analyze their computational complexities and develop exact algorithms where possible. We next consider generating extreme supported nondominated points of multiob...
Approaches for multi-objective combinatorial optimization problems
Lokman, Banu; Köksalan, Murat; Department of Industrial Engineering (2007)
In this thesis, we develop two exact algorithms and a heuristic procedure for Multiobjective Combinatorial Optimization Problems (MOCO). Our exact algorithms guarantee to generate all nondominated solutions of any MOCO problem. We test the performance of the algorithms on randomly generated problems including the Multiobjective Knapsack Problem, Multi-objective Shortest Path Problem and Multi-objective Spanning Tree Problem. Although we showed the algorithms work much better than the previous ones, we also ...
Approaches for multi-attribute auctions
Karakaya, Gülşah; Köksalan, Murat; Department of Industrial Engineering (2009)
There is a growing interest in electronic auctions in the literature. Many researchers work on the single attribute version of the problem. Multi-attribute version of the problem is more realistic. However, this brings a substantial difficulty in solving the problem. In order to overcome the computational difficulties, we develop an Evolutionary Algorithm (EA) for the case of multi-attribute multi-item reverse auctions. We generate the whole Pareto front using the EA. We also develop heuristic procedures to...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
M. Tehneldere, “Approaches for discrete alternative multiple criteria decision making for monotonic utility functions,” Middle East Technical University, 1994.