1 resultado para secure routing protocols
em Universidade Complutense de Madrid
Filtro por publicador
- Repository Napier (1)
- AMS Campus - Alm@DL - Università di Bologna (1)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (19)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (14)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (2)
- Archive of European Integration (23)
- Aston University Research Archive (3)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (15)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (22)
- Biodiversity Heritage Library, United States (1)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (75)
- Bucknell University Digital Commons - Pensilvania - USA (1)
- Bulgarian Digital Mathematics Library at IMI-BAS (1)
- CentAUR: Central Archive University of Reading - UK (47)
- Cochin University of Science & Technology (CUSAT), India (16)
- Comissão Econômica para a América Latina e o Caribe (CEPAL) (2)
- Consorci de Serveis Universitaris de Catalunya (CSUC), Spain (56)
- CUNY Academic Works (1)
- Dalarna University College Electronic Archive (2)
- Department of Computer Science E-Repository - King's College London, Strand, London (7)
- Digital Commons - Michigan Tech (2)
- Digital Commons @ Winthrop University (1)
- Digital Commons at Florida International University (6)
- Digital Peer Publishing (2)
- DigitalCommons@The Texas Medical Center (1)
- DigitalCommons@University of Nebraska - Lincoln (9)
- Digitale Sammlungen - Goethe-Universität Frankfurt am Main (1)
- Doria (National Library of Finland DSpace Services) - National Library of Finland, Finland (16)
- DRUM (Digital Repository at the University of Maryland) (2)
- Harvard University (2)
- Illinois Digital Environment for Access to Learning and Scholarship Repository (1)
- Institute of Public Health in Ireland, Ireland (3)
- Instituto Politécnico do Porto, Portugal (24)
- Iowa Publications Online (IPO) - State Library, State of Iowa (Iowa), United States (196)
- Martin Luther Universitat Halle Wittenberg, Germany (2)
- Massachusetts Institute of Technology (1)
- Memorial University Research Repository (1)
- Ministerio de Cultura, Spain (1)
- National Center for Biotechnology Information - NCBI (3)
- Nottingham eTheses (1)
- RepoCLACAI - Consorcio Latinoamericano Contra el Aborto Inseguro (1)
- Repositório Científico do Instituto Politécnico de Lisboa - Portugal (3)
- Repositório da Produção Científica e Intelectual da Unicamp (1)
- Repositório digital da Fundação Getúlio Vargas - FGV (2)
- Repositório Institucional da Universidade de Aveiro - Portugal (1)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (91)
- RUN (Repositório da Universidade Nova de Lisboa) - FCT (Faculdade de Cienecias e Technologia), Universidade Nova de Lisboa (UNL), Portugal (13)
- School of Medicine, Washington University, United States (2)
- Scielo Saúde Pública - SP (11)
- Universidad de Alicante (4)
- Universidad del Rosario, Colombia (2)
- Universidad Politécnica de Madrid (33)
- Universidade Complutense de Madrid (1)
- Universidade do Minho (9)
- Universidade Federal do Pará (5)
- Universita di Parma (1)
- Universitat de Girona, Spain (16)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (1)
- Université de Lausanne, Switzerland (22)
- Université de Montréal, Canada (14)
- University of Michigan (3)
- University of Queensland eSpace - Australia (14)
- University of Southampton, United Kingdom (10)
- WestminsterResearch - UK (2)
Resumo:
In maritime transportation, decisions are made in a dynamic setting where many aspects of the future are uncertain. However, most academic literature on maritime transportation considers static and deterministic routing and scheduling problems. This work addresses a gap in the literature on dynamic and stochastic maritime routing and scheduling problems, by focusing on the scheduling of departure times. Five simple strategies for setting departure times are considered, as well as a more advanced strategy which involves solving a mixed integer mathematical programming problem. The latter strategy is significantly better than the other methods, while adding only a small computational effort.