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
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
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
Foreword
Download
index.pdf
Date
2016-06-01
Author
Alparslan-Gok, S. Zeynep
Weber, Gerhard Wilhelm
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
41
views
0
downloads
Cite This
Subject Keywords
Computer science
,
Software engineering
,
Operations research & management science
,
Mathematics, applied
URI
https://hdl.handle.net/11511/57390
Journal
OPTIMIZATION METHODS & SOFTWARE
DOI
https://doi.org/10.1080/10556788.2016.1175692
Collections
Graduate School of Applied Mathematics, Article
Suggestions
OpenMETU
Core
Special Issue: 24th Mini-EURO Conference on Continuous Optimization and Information-Based Technologies in the Financial Sector, Izmir, Turkey, June 23-26, 2010 PREFACE
KASIMBEYLİ, REFAİL; Weber, Gerhard Wilhelm; Dincer, Cemali (2012-01-01)
A decomposition approach for undiscounted two-person zero-sum stochastic games
Avşar, Zeynep Müge (Springer Science and Business Media LLC, 1999-06-01)
Two-person zero-sum stochastic games are considered under the long-run average expected payoff criterion. State and action spaces are assumed finite. By making use of the concept of maximal communicating classes, the following decomposition algorithm is introduced for solving two-person zero-sum stochastic games: First, the state space is decomposed into maximal communicating classes. Then, these classes are organized in an hierarchical order where each level may contain more than one maximal communicating ...
Cooperative games under bubbly uncertainty
PALANCI, Osman; ALPARSLAN GÖK, Sırma Zeynep; Weber, Gerhard Wilhelm (Springer Science and Business Media LLC, 2014-10-01)
The allocation problem of rewards/costs is a basic question for players, namely, individuals and companies that are planning cooperation under uncertainty. The involvement of uncertainty in cooperative game theory is motivated by the real world in which noise in observation and experimental design, incomplete information and vagueness in preference structures and decision-making play an important role. In this study, a new class of cooperative games, namely, the cooperative bubbly games, where the worth of ...
A survey on OR and mathematical methods applied on gene-environment networks
Weber, Gerhard Wilhelm; Kropat, Erik; Öztürk, Başak; Gorgulu, Zafer-Korcan (Springer Science and Business Media LLC, 2009-09-01)
In this paper, we survey the recent advances and mathematical foundations of gene-environment networks. We explain their interdisciplinary implications with special regard to human and life sciences as well as financial sciences. Special attention is paid to applications in Operational Research and environmental protection. Originally developed in the context of modeling and prediction of gene-expression patterns, gene-environment networks have proved to provide a conceptual framework for the modeling of dy...
Special issue: Optimization in the natural sciences
Tchemisova, Tatiana; Freitas, Adelaide; Plakhov, Alexander; Weber, Gerhard Wilhelm (2015-06-03)
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
S. Z. Alparslan-Gok and G. W. Weber, “Foreword,”
OPTIMIZATION METHODS & SOFTWARE
, pp. 445–445, 2016, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/57390.