Zobrazeno 1 - 10
of 696
pro vyhledávání: '"Fieger, A."'
Publikováno v:
European Business Review, 2024, Vol. 36, Issue 6, pp. 962-980.
Externí odkaz:
http://www.emeraldinsight.com/doi/10.1108/EBR-09-2023-0285
Autor:
Fieger, Peter, Rice, John
Publikováno v:
In Applied Nursing Research December 2024 80
Publikováno v:
Journal of Tourism, Heritage & Services Marketing, Vol 9, Iss 1, Pp 58-66 (2023)
Purpose: This case study examines Marriott Corporation’s large and successful spinoff between 1993 and 1995 and the concomitant adoption of a corporate ALFO strategy enabled by the transfer of assets and debt between the two entities. As an example
Externí odkaz:
https://doaj.org/article/6b00d345b8fa41598ded15882d7aa162
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
We propose an exact algorithm for solving the longest simple path problem between two given vertices in undirected weighted graphs. By using graph partitioning and dynamic programming, we obtain an algorithm that is significantly faster than other st
Externí odkaz:
http://arxiv.org/abs/1905.03645
Autor:
Choo, Nicolas1 (AUTHOR), Fieger, Peter2 (AUTHOR), Wells, Paul3 (AUTHOR) paul.wells@aut.ac.nz, Tseng, Katie3 (AUTHOR)
Publikováno v:
Accounting Education. Sep2024, p1-25. 25p. 4 Illustrations.
Publikováno v:
Journal of Tourism, Heritage & Services Marketing, 9, 1, 58-66
Purpose: This case study examines Marriott Corporation's large and successful spinoff between 1993 and 1995 and the concomitant adoption of a corporate ALFO strategy enabled by the transfer of assets and debt between the two entities. As an example o
Externí odkaz:
https://www.ssoar.info/ssoar/handle/document/87150
Publikováno v:
Employee Relations: The International Journal, 2021, Vol. 44, Issue 2, pp. 319-334.
Externí odkaz:
http://www.emeraldinsight.com/doi/10.1108/ER-07-2020-0346
We propose an optimal algorithm for solving the longest path problem in undirected weighted graphs. By using graph partitioning and dynamic programming, we obtain an algorithm that is significantly faster than other state-of-the-art methods. This ena
Externí odkaz:
http://arxiv.org/abs/1702.04170
Publikováno v:
Journal of Service Management, 2020, Vol. 32, Issue 1, pp. 113-128.
Externí odkaz:
http://www.emeraldinsight.com/doi/10.1108/JOSM-05-2020-0151