Zobrazeno 1 - 10 of 32 pro vyhledávání: '"Tjark Vredeveld"'
1
A note on equitable Hamiltonian cycles
Autor: Tim Ophelders, Roel Lambers, Tjark Vredeveld, Frits C. R. Spieksma
Publikováno v: Discrete Applied Mathematics, 303, 127-136. Elsevier
Discrete Applied Mathematics, 303(XX), 127-136. Elsevier
Given a complete graph with an even number of vertices, and with each edge colored with one of two colors (say red or blue), an equitable Hamiltonian cycle is a Hamiltonian cycle that can be decomposed into two perfect matchings such that both perfec
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::98c93d0aca7fb40e66f5f1a9f527b2cf
https://doi.org/10.1016/j.dam.2020.08.023
Zobrazit plný text záznamu
2
Posted Price Mechanisms and Optimal Threshold Strategies for Random Arrivals
Autor: Patricio Foncea, Tim Oosterwijk, Tjark Vredeveld, Ruben Hoeksma, José R. Correa
Publikováno v: Correa, J, Foncea, P, Hoeksma, R, Oosterwijk, T & Vredeveld, T 2021, ' Posted Price Mechanisms and Optimal Threshold Strategies for Random Arrivals ', Mathematics of Operations Research, vol. 46, no. 4, pp. 1452-1478 . https://doi.org/10.1287/moor.2020.1105
Mathematics of Operations Research, 46(4), 1452-1478. Institute for Operations Research and the Management Sciences
Mathematics of Operations Research, 46(4), 1452-1478. INFORMS Inst.for Operations Res.and the Management Sciences
Mathematics of operations research, 46(4), 1452-1478. INFORMS Institute for Operations Research and the Management Sciences
The classic prophet inequality states that, when faced with a finite sequence of nonnegative independent random variables, a gambler who knows the distribution and is allowed to stop the sequence at any time, can obtain, in expectation, at least half
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::87cd7c962ee85f56fc612ad56f9e842f
https://hdl.handle.net/1871.1/1054c322-a06a-4312-935d-86dcd85fe555
Zobrazit plný text záznamu
3
Recent Developments in Prophet Inequalities
Autor: Tim Oosterwijk, Tjark Vredeveld, Patricio Foncea, Ruben Hoeksma, José R. Correa
Publikováno v: Correa, J, Foncea, P, Hoeksma, R, Oosterwijk, T & Vredeveld, T 2019, ' Recent Developments in Prophet Inequalities ', ACM SIGecom Exchanges, vol. 17, no. 1, pp. 61-70 . < http://www.sigecom.org/exchanges/volume_17/1/CORREA.pdf >
Sigecom exchanges, 17(1), 61-70. Association for Computing Machinery
ACM SIGecom Exchanges
ACM SIGecom Exchanges, 17(1), 61-70. ACM
The classic prophet inequality states that, when faced with a finite sequence of non-negative independent random variables, a gambler who knows their distribution and is allowed to stop the sequence at any time, can obtain, in expectation, at least h
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1f0c51e12d9f989d7dcffaa01617ad46
https://hdl.handle.net/1871.1/63d0730c-2846-40ff-8fbe-f0e6f0190676
Zobrazit plný text záznamu
4
Performance analysis of fixed assignment policies for stochastic online scheduling on uniform parallel machines
Autor: Tjark Vredeveld, Moritz Buchem
Publikováno v: Computers & Operations Research, 125:105093. Elsevier Limited
In stochastic online scheduling problems, a common class of policies is the class of fixed assignment policies. These policies first assign jobs to machines and then apply single machine scheduling policies for each machine separately. We consider a
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9a3f15e7bd16cfd7c2c837bc16d31438
https://doi.org/10.1016/j.cor.2020.105093
Zobrazit plný text záznamu
5
Disagreement on the Gain Sharing Method in Supply Chain Collaborations
Autor: Verena Jung, Marianne Peeters, Tjark Vredeveld
Publikováno v: Russian Management Journal. 16:537-562
Due to a constantly growing competition among organizations and higher customer expectations, in the course of the last decades companies started to realize the need for supply chain collaboration (SCC). However, setting up a coalition is often chall
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::8eaf20eac0a423cac724c41b63c77f5c
https://doi.org/10.21638/spbu18.2018.404
Zobrazit plný text záznamu
6
Posted Price Mechanisms for a Random Stream of Customers
Autor: Patricio Foncea, José R. Correa, Tim Oosterwijk, Ruben Hoeksma, Tjark Vredeveld
Publikováno v: EC
EC '17 Proceedings of the 2017 ACM Conference on Economics and Computation, 169-186
STARTPAGE=169;ENDPAGE=186;TITLE=EC '17 Proceedings of the 2017 ACM Conference on Economics and Computation
Posted price mechanisms constitute a widely used way of selling items to strategic consumers. Although suboptimal, the attractiveness of these mechanisms comes from their simplicity and easy implementation. In this paper, we investigate the performan
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3c295a63a0740feead7769e42a26001d
http://delivery.acm.org/10.1145/3090000/3085137/p169-
Zobrazit plný text záznamu
7
Approximating vector scheduling: almost matching upper and lower bounds
Autor: Nikhil Bansal, Tim Oosterwijk, Tjark Vredeveld, Ruben van der Zwaan
Publikováno v: Algorithmica, 76(4), 1077-1096. Springer
Algorithmica
Algorithmica, 76(4), 1077-1096. Springer Verlag
We consider the Vector Scheduling problem, a natural generalization of the classical makespan minimization problem to multiple resources. Here, we are given n jobs, represented as d-dimensional vectors in \documentclass[12pt]{minimal} \usepackage{ams
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ee18c151d4c8c7be529b046a8f88a989
https://research.tue.nl/nl/publications/03d9bc9d-38e4-4761-8147-8a20d48a1d2c
Zobrazit plný text záznamu
8
A Logarithmic Approximation for Polymatroid Congestion Games
Autor: Tobias Harks, Tjark Vredeveld, Tim Oosterwijk
Publikováno v: Operations Research Letters, 44(6), 712-717. Elsevier Science
We study the problem of computing a social optimum in polymatroid congestion games, where the strategy space of every player consists of a player-specific integral polymatroid base polyhedron on a set of resources. For non-decreasing cost functions w
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0130493b7d27034e358bc97253ae6b34
https://cris.maastrichtuniversity.nl/en/publications/21d94606-76a7-4bc4-99ac-be397aa4b951
Zobrazit plný text záznamu
10
Performance guarantees of jump neighborhoods on restricted related parallel machines
Autor: Tjark Vredeveld, Petra Schuurman, Cyriel Rutten, Diego Recalde
Publikováno v: Operations Research Letters, 40(4), 287-291. Elsevier Science
We study the performance of two popular jump neighborhoods on the classical scheduling problem of minimizing the makespan on related parallel machines under the additional restriction that jobs are only allowed to be scheduled on a subset of machines
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d36fe5c1da861b61f4466ae7201c7a40
https://doi.org/10.1016/j.orl.2012.04.002
Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání

Omezení vyhledávání
Plný text Recenzováno Digitální knihovna AV ČR
Zdroje