MINMAX REGRET MASALAH OPTIMASI KOMBINATORIAL DENGAN DATA INTERVAL
In this final project, we discuss about combinatorial optimization problem with data interval by using minmax regret decision theory. At the beginning of discussion will begins with a discussion of common optimization problem, then from the usual optimization problems are brought into a state of unc...
Saved in:
Main Authors: | , QORIATUN MARYAMAH, , Ari Suparwanto, M.SiDr. rer. Nat |
---|---|
Format: | Theses and Dissertations NonPeerReviewed |
Published: |
[Yogyakarta] : Universitas Gadjah Mada
2014
|
Subjects: | |
Online Access: | https://repository.ugm.ac.id/126586/ http://etd.ugm.ac.id/index.php?mod=penelitian_detail&sub=PenelitianDetail&act=view&typ=html&buku_id=66813 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Universitas Gadjah Mada |
Similar Items
-
A probabilistic model for minmax regret in combinatorial optimization
by: Natarajan, K., et al.
Published: (2014) -
Penyelesaian masalah integer knapsack dengan konstrain minmax menggunakan dynamic programming
by: , RAHAJOE, Rr. Ani Dijah, et al.
Published: (2010) -
A minmax relationship between embeddable and rigid graphs
by: Tay, T.S., et al.
Published: (2014) -
Pemrograman berbasis Oop untuk mensimulasikan rangkaian digital pada untai nalar kombinatorial dan sekuensial
by: , YULIATMOJO, Pitoyo, et al.
Published: (2002) -
Action/inaction and regret : is closeness the moderating effect of regret?
by: Chua, Li Bing., et al.
Published: (2008)