Zobrazeno 1 - 10
of 33
pro vyhledávání: '"Sven de Vries"'
Publikováno v:
INFORMS Journal on Computing. 34:3117-3133
Linear complementarity problems (LCPs) are an important modeling tool for many practically relevant situations and also have many important applications in mathematics itself. Although the continuous version of the problem is extremely well-studied,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e7be3469f9434b0b8d361ed7c24227da
https://doi.org/10.1287/ijoc.2022.1216
https://doi.org/10.1287/ijoc.2022.1216
Tight compact extended relaxations for nonconvex quadratic programming problems with box constraints
Autor:
Sven de Vries, Bernd Perscheid
Publikováno v:
Journal of Global Optimization. 84:591-606
Cutting planes from the Boolean Quadric Polytope can be used to reduce the optimality gap of the $$\mathcal {NP}$$ NP -hard nonconvex quadratic program with box constraints (BoxQP). It is known that all cuts of the Chvátal–Gomory closure of the Bo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2629e8cd09a54c19a4d5bab77f71f028
https://doi.org/10.1007/s10898-022-01157-9
https://doi.org/10.1007/s10898-022-01157-9
Autor:
Sven de Vries, Bernd Perscheid
Publikováno v:
Discrete Applied Mathematics. 303:14-21
For sparse graphs, the odd cycle polytope can be used to compute useful bounds for the maximum stable set problem quickly. Yannakakis (1991) introduced an extended formulation for the odd cycle inequalities of the stable set polytope, which provides
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c1acfc2de3cb3135a029d2f6fc7260bf
https://doi.org/10.1016/j.dam.2020.10.006
https://doi.org/10.1016/j.dam.2020.10.006
Publikováno v:
Discrete Applied Mathematics. 272:16-23
We consider the set of gross substitutes valuations which is one of the most important classes of valuation functions in combinatorial auctions. This is due the fact that the existence of a Walrasian equilibrium is guaranteed if all bidders have gros
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dd8c256a1419cf2081a814dc67d273aa
https://doi.org/10.1016/j.dam.2018.11.003
https://doi.org/10.1016/j.dam.2018.11.003
Publikováno v:
Networks. 75:86-94
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dc095ee3a8a5494180f49fa8e5d7ac74
https://doi.org/10.1002/net.21906
https://doi.org/10.1002/net.21906
Publikováno v:
Networks. 70:116-131
Ring structures in molecules belong to the most impor-tant substructures for many applications in Computa-tional Chemistry. One typical task is to find an implicitdescription of the ring structure of a molecule. Wepresent efficient algorithms for c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b55efa3a07df6c5a5e2dc156f1c11094
https://doi.org/10.1002/net.21757
https://doi.org/10.1002/net.21757
Autor:
Rakesh Vohra, Sven de Vries
Milgrom (2017) has proposed a heuristic for determining a maximum weight basis of an independence system ${\mathcal I}$ given that we want an approximation guarantee only for sets in a prescribed ${\mathcal O}\subseteq {\mathcal I}$. This ${\mathcal
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d34f35eb2935615745179352526643fb
http://arxiv.org/abs/1906.06217
http://arxiv.org/abs/1906.06217
Publikováno v:
Computational Statistics & Data Analysis. 92:1-12
In stratified random sampling, minimizing the variance of a total estimate leads to the optimal allocation. However, in practice, this original method is scarcely appropriate since in many applications additional constraints have to be considered. Th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7687f7fe7b08a0889e85e141ad6067c4
https://doi.org/10.1016/j.csda.2015.06.003
https://doi.org/10.1016/j.csda.2015.06.003
Autor:
Sven de Vries
Publikováno v:
Discrete Applied Mathematics. 195:74-83
Using graph products we present an O ( | V | 2 | E | + | V | 3 log | V | ) separation algorithm for the nonsimple 1 -wheel inequalities by Cheng and Cunningham (1997) of the stable set polytope, which is faster than their O ( | V | 4 ) algorithm.Ther
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4bb0fae98f7942229e569f2b850686c2
https://doi.org/10.1016/j.dam.2014.07.027
https://doi.org/10.1016/j.dam.2014.07.027
Publikováno v:
Operations Research. 59:400-413
Consider selling bundles of indivisible goods to buyers with concave utilities that are additively separable in money and goods. We propose an ascending auction for the case when the seller is constrained to sell bundles whose elements form a basis o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5224f27897835335fda9cff8ae281d56
https://doi.org/10.1287/opre.1100.0888
https://doi.org/10.1287/opre.1100.0888