Starten Sie Ihre Suche...


Durch die Nutzung unserer Webseite erklären Sie sich damit einverstanden, dass wir Cookies verwenden. Weitere Informationen
Sven de Vries

Univ.-Prof. Dr. Sven de Vries

Mathematik, Universität Trier

Publikationen
Ergebnisse pro Seite:  25

De Santis, Marianna; de Vries, Sven; Schmidt, Martin et al.

A Penalty Branch-and-Bound Method for Mixed Binary Linear Complementarity Problems

INFORMS Journal on Computing. Bd. 34. H. 6. Institute for Operations Research and the Management Sciences (INFORMS) 2022 S. 3117 - 3133


Vries, Sven de; Perscheid, Bernd

Tight compact extended relaxations for nonconvex quadratic programming problems with box constraints

Journal of Global Optimization. Bd. 84. H. 3. Springer Science and Business Media LLC 2022 S. 591 - 606


de Vries, Sven; Perscheid, Bernd

A smaller extended formulation for the odd cycle inequalities of the stable set polytope

Discrete Applied Mathematics. Bd. 303. Elsevier BV 2021 S. 14 - 21


de Vries, Sven; Friedrich, Ulf; Raach, Stephen

Geometry of gross substitutes valuations

Discrete Applied Mathematics. Bd. 272. Elsevier BV 2020 S. 16 - 23


de Vries, Sven; Vohra, Rakesh V.

Matroidal approximations of independence systems

Operations Research Letters. Bd. 48. H. 5. Elsevier BV 2020 S. 587 - 593


Vries, Sven; Friedrich, Ulf; Perscheid, Bernd

An extended formulation for the 1‐wheel inequalities of the stable set polytope

Networks. Bd. 75. H. 1. Wiley 2019 S. 86 - 94


Berger, Franziska; Gritzmann, Peter; de Vries, Sven

Computing cyclic invariants for molecular graphs

Networks. Bd. 70. H. 2. Wiley 2017 S. 116 - 131


Friedrich, Ulf; Münnich, Ralf; de Vries, Sven et al.

Fast integer-valued algorithms for optimal allocations under constraints in stratified sampling

Computational Statistics & Data Analysis. Bd. 92. Elsevier BV 2015 S. 1 - 12


de Vries, Sven

Faster separation of 1-wheel inequalities by graph products

Discrete Applied Mathematics. Bd. 195. Elsevier BV 2015 S. 74 - 83


Bikhchandani, Sushil; de Vries, Sven; Schummer, James et al.

An Ascending Vickrey Auction for Selling Bases of a Matroid

OPERATIONS RESEARCH. Bd. 59. H. 2. 2011 S. 400 - 413


Bastert, Oliver; Hummel, Benjamin; de Vries, Sven

A Generalized Wedelin Heuristic for Integer Programming

INFORMS JOURNAL ON COMPUTING. Bd. 22. H. 1. 2010 S. 93 - 107


Berger, Franziska; Gritzmann, Peter; de Vries, Sven

Minimum Cycle Bases and Their Applications

Lerner, Jürgen; Wagner, Dorothea; Zweig, Katharina A. (Hrsg). Algorithmics of Large and Complex Networks. 1.0. Aufl. Berlin Heidelberg: Springer 2009 S. 34 - 49


de Vries, Sven; Bikhchandani, Sushil; Schummer, James et al.

Ascending Auctions for Integral (Poly)-Matroids with Concave Nondecreasing Separable Values

Proceedings of the nineteenth annual ACM-SIAM symposium on discrete algorithms (SODA). 1st. Aufl. Philadelphia, PA: Society for Industrial and Applied Mathematics 2008 S. 864 - 873


Brunetti, S.; Del Lungo, A.; Gritzmann, P. et al.

On the reconstruction of binary and permutation matrices under (binary) tomographic constraints

THEORETICAL COMPUTER SCIENCE. Bd. 406. H. 1-2. 2008 S. 63 - 71


de Vries, Sven; Schummer, James; Vohra, Rakesh V.

On ascending Vickrey auctions for heterogeneous objects

JOURNAL OF ECONOMIC THEORY. Bd. 132. H. 1. 2007 S. 95 - 118


de Vries, Sven; Posner, Marc E.; Vohra, Rakesh V.

Polyhedral properties of the K-median problem on a tree

MATHEMATICAL PROGRAMMING. Bd. 110. H. 2. 2007 S. 261 - 285


Gunluk, O; Ladanyi, L; de Vries, S

A branch-and-price algorithm and new test problems for spectrum auctions

MANAGEMENT SCIENCE. Bd. 51. H. 3. 2005 S. 391 - 406


Lee, J; Leung, J; De Vries, S

Separating type-I odd-cycle inequalities for a binary-encoded edge-coloring formulation

JOURNAL OF COMBINATORIAL OPTIMIZATION. Bd. 9. H. 1. 2005 S. 59 - 67


de Vries, Sven; Vohra, Rakesh V.

Design of combinatorial auctions

Simchi-Levi, D. ; Wu, S.D.; Shen, Z.-J. (Hrsg). Handbook of Quantitative Supply Chain Analysis: Modeling in the E-Business Era. 1st. Aufl. Boston/Dordrecht/London: Kluwer 2004 S. 247 - 292


Berger, F; Gritzmann, P; de Vries, S

Minimum cycle bases for network graphs

ALGORITHMICA. Bd. 40. H. 1. 2004 S. 51 - 62


Cheng, E; de Vries, S

Separating multi-oddity constrained shortest circuits over the polytope of stable multisets

OPERATIONS RESEARCH LETTERS. Bd. 32. H. 2. 2004 S. 181 - 184


de Vries, S; Vohra, RV

Combinatorial auctions: A survey

INFORMS JOURNAL ON COMPUTING. Bd. 15. H. 3. 2003 S. 284 - 309


Gritzmann, Peter; de Vries, Sven

Reconstructing crystalline structures from few images under high resolution transmission electron microscopy

Jäger, W.; Krebs, H.-J. (Hrsg). Mathematics---Key Technology for the Future. 1st. Aufl. Berlin: Springer 2003 S. 441 - 459


Cheng, E; de Vries, S

Antiweb-wheel inequalities and their separation problems over the stable set polytopes

MATHEMATICAL PROGRAMMING. Bd. 92. H. 1. 2002 S. 153 - 175


de Vries, Sven; Bikhchandani, Sushil; Schummer, James et al.

Linear programming and Vickrey auctions

Dietrich, B.; Vohra, Rakesh V. (Hrsg). Mathematics of the Internet: E-Auctions and Markets. NY: Springer 2002 S. 75 - 116