1 resultado para Fire interval
em Digital Peer Publishing
Filtro por publicador
- Aberystwyth University Repository - Reino Unido (1)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (2)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (5)
- Aquatic Commons (6)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (1)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (2)
- Biblioteca Digital | Sistema Integrado de Documentación | UNCuyo - UNCUYO. UNIVERSIDAD NACIONAL DE CUYO. (1)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (9)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (7)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (77)
- Brock University, Canada (7)
- Bucknell University Digital Commons - Pensilvania - USA (1)
- Cambridge University Engineering Department Publications Database (13)
- CentAUR: Central Archive University of Reading - UK (48)
- Center for Jewish History Digital Collections (3)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (12)
- Cochin University of Science & Technology (CUSAT), India (2)
- Collection Of Biostatistics Research Archive (8)
- CORA - Cork Open Research Archive - University College Cork - Ireland (1)
- CUNY Academic Works (1)
- Dalarna University College Electronic Archive (2)
- Deakin Research Online - Australia (172)
- Department of Computer Science E-Repository - King's College London, Strand, London (2)
- DI-fusion - The institutional repository of Université Libre de Bruxelles (1)
- Digital Archives@Colby (3)
- Digital Commons - Michigan Tech (1)
- Digital Commons - Montana Tech (3)
- Digital Commons @ Winthrop University (1)
- Digital Peer Publishing (1)
- DigitalCommons@The Texas Medical Center (6)
- DigitalCommons@University of Nebraska - Lincoln (6)
- Digitale Sammlungen - Goethe-Universität Frankfurt am Main (2)
- Duke University (2)
- eResearch Archive - Queensland Department of Agriculture; Fisheries and Forestry (14)
- Gallica, Bibliotheque Numerique - Bibliothèque nationale de France (French National Library) (BnF), France (2)
- Greenwich Academic Literature Archive - UK (56)
- Helda - Digital Repository of University of Helsinki (7)
- Indian Institute of Science - Bangalore - Índia (24)
- Instituto Politécnico do Porto, Portugal (12)
- Massachusetts Institute of Technology (1)
- Ministerio de Cultura, Spain (2)
- Plymouth Marine Science Electronic Archive (PlyMSEA) (1)
- Publishing Network for Geoscientific & Environmental Data (164)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (103)
- Queensland University of Technology - ePrints Archive (106)
- Repositório Científico do Instituto Politécnico de Lisboa - Portugal (1)
- Repositório Institucional da Universidade de Aveiro - Portugal (3)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (72)
- SAPIENTIA - Universidade do Algarve - Portugal (1)
- School of Medicine, Washington University, United States (1)
- Universidad Autónoma de Nuevo León, Mexico (1)
- Universidad del Rosario, Colombia (1)
- Universidade Federal do Rio Grande do Norte (UFRN) (1)
- Universitat de Girona, Spain (9)
- Université de Lausanne, Switzerland (4)
- Université de Montréal, Canada (4)
- University of Connecticut - USA (1)
Resumo:
Recently, Branzei, Dimitrov, and Tijs (2003) introduced cooperative interval-valued games. Among other insights, the notion of an interval core has been coined and proposed as a solution concept for interval-valued games. In this paper we will present a general mathematical programming algorithm which can be applied to find an element in the interval core. As an example, we discuss lot sizing with uncertain demand to provide an application for interval-valued games and to demonstrate how interval core elements can be computed. Also, we reveal that pitfalls exist if interval core elements are computed in a straightforward manner by considering the interval borders separately.