Zobrazeno 1 - 10
of 16 190
pro vyhledávání: '"A Rohwedder"'
Local search is a widely used technique for tackling challenging optimization problems, offering simplicity and strong empirical performance across various problem domains. In this paper, we address the problem of scheduling a set of jobs on identica
Externí odkaz:
http://arxiv.org/abs/2411.17245
Autor:
Rohwedder, Lars, Węgrzycki, Karol
Integer linear programs $\min\{c^T x : A x = b, x \in \mathbb{Z}^n_{\ge 0}\}$, where $A \in \mathbb{Z}^{m \times n}$, $b \in \mathbb{Z}^m$, and $c \in \mathbb{Z}^n$, can be solved in pseudopolynomial time for any fixed number of constraints $m = O(1)
Externí odkaz:
http://arxiv.org/abs/2409.03681
Autor:
Rohwedder, Lars, Węgrzycki, Karol
Integer Linear Programming with $n$ binary variables and $m$ many $0/1$-constraints can be solved in time $2^{\tilde O(m^2)} \text{poly}(n)$ and it is open whether the dependence on $m$ is optimal. Several seemingly unrelated problems, which include
Externí odkaz:
http://arxiv.org/abs/2409.03675
We consider the problem of allocating indivisible resources to players so as to maximize the minimum total value any player receives. This problem is sometimes dubbed the Santa Claus problem and its different variants have been subject to extensive r
Externí odkaz:
http://arxiv.org/abs/2407.04824
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 consider the problem of finding a basis of a matroid with weight exactly equal to a given target. Here weights can be discrete values from $\{-\Delta,\ldots,\Delta\}$ or more generally $m$-dimensional vectors of such discrete values. We resolve th
Externí odkaz:
http://arxiv.org/abs/2404.03747
Local search is a widely used technique for tackling challenging optimization problems, offering significant advantages in terms of computational efficiency and exhibiting strong empirical behavior across a wide range of problem domains. In this pape
Externí odkaz:
http://arxiv.org/abs/2401.05956
A prominent problem in scheduling theory is the weighted flow time problem on one machine. We are given a machine and a set of jobs, each of them characterized by a processing time, a release time, and a weight. The goal is to find a (possibly preemp
Externí odkaz:
http://arxiv.org/abs/2308.06209
Autor:
Hanks, Patrick, Lenarčič, Simon
Publikováno v:
Dictionary of American Family Names, 2 ed., 2022.
Externí odkaz:
http://www.oxfordreference.com/view/10.1093/acref/9780190245115.001.0001/acref-9780190245115-e-63153
Publikováno v:
Journal of Applied Econometrics. 36:474-483
Meijer, Rohwedder, and Wansbeek (MRW, Journal of Business & Economic Statistics, 2012) developed methods for prediction of a single earnings figure per worker from mixture factor models fitted using earnings data from multiple linked data sources. MR
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::976c204ff111a31f49e3f019abd86065
https://doi.org/10.1002/jae.2811
https://doi.org/10.1002/jae.2811