Bastert, Oliver; Hummel, Benjamin; de Vries, Sven
A Generalized Wedelin Heuristic for Integer ProgrammingINFORMS JOURNAL ON COMPUTING. Bd. 22. H. 1. 2010 S. 93 - 107
Berger, Franziska; Gritzmann, Peter; de Vries, Sven
Minimum Cycle Bases and Their ApplicationsLerner, 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 ValuesProceedings 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 constraintsTHEORETICAL 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 objectsJOURNAL 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 treeMATHEMATICAL 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 auctionsMANAGEMENT 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 formulationJOURNAL OF COMBINATORIAL OPTIMIZATION. Bd. 9. H. 1. 2005 S. 59 - 67
de Vries, Sven; Vohra, Rakesh V.
Design of combinatorial auctionsSimchi-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 graphsALGORITHMICA. Bd. 40. H. 1. 2004 S. 51 - 62