Sven de Vries

Bernd Perscheid

J. Glob. Optim., 2022

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

[BibT_eX]

[DOI]

INFORMS J. Comput., 2022

2021

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

[BibT_eX]

[DOI]

Bernd Perscheid

Discret. Appl. Math., 2021

2020

Matroidal approximations of independence systems.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2020

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

[BibT_eX]

[DOI]

Ulf Friedrich

Bernd Perscheid

Networks, 2020

Geometry of gross substitutes valuations.

[BibT_eX]

[DOI]

Ulf Friedrich

Stephen Raach

Discret. Appl. Math., 2020

2017

Computing cyclic invariants for molecular graphs.

[BibT_eX]

[DOI]

Franziska Berger

Networks, 2017

2015

Faster separation of 1-wheel inequalities by graph products.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

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

[BibT_eX]

[DOI]

Comput. Stat. Data Anal., 2015

2013

Graph products for faster separation of 1-wheel inequalities.

[BibT_eX]

Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2013

2011

An Ascending Vickrey Auction for Selling Bases of a Matroid.

[BibT_eX]

[DOI]

Oper. Res., 2011

2010

A Generalized Wedelin Heuristic for Integer Programming.

[BibT_eX]

[DOI]

Oliver Bastert

Benjamin Hummel

INFORMS J. Comput., 2010

2009

Minimum Cycle Bases and Their Applications.

[BibT_eX]

[DOI]

Franziska Berger

Proceedings of the Algorithmics of Large and Complex Networks - Design, 2009

2008

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

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

Ascending auctions for integral (poly)matroids with concave nondecreasing separable values.

[BibT_eX]

[DOI]

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

2007

Polyhedral Properties of the <i>K</i> -median Problem on a Tree.

[BibT_eX]

[DOI]

Marc E. Posner

Math. Program., 2007

On ascending Vickrey auctions for heterogeneous objects.

[BibT_eX]

[DOI]

James Schummer

J. Econ. Theory, 2007

2005

A Branch-and-Price Algorithm and New Test Problems for Spectrum Auctions.

[BibT_eX]

[DOI]

Oktay Günlük

Laszlo Ladányi

Manag. Sci., 2005

Separating Type-I Odd-Cycle Inequalities for a Binary-Encoded Edge-Coloring Formulation.

[BibT_eX]

[DOI]

Jon Lee

Janny Leung

J. Comb. Optim., 2005

2004

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

[BibT_eX]

[DOI]

Oper. Res. Lett., 2004

Minimum Cycle Bases for Network Graphs.

[BibT_eX]

[DOI]

Franziska Berger

Algorithmica, 2004

2003

Combinatorial Auctions: A Survey.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2003

2002

On the algorithmic inversion of the discrete Radon transform.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

On the Facet-Inducing Antiweb-Wheel Inequalities for Stable Set Polytopes.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2002

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

[BibT_eX]

[DOI]

Math. Program., 2002

Separation of Antiweb-Wheel Inequalities Over Stable Set Polytopes.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2002

2000

Approximating Binary Images from Discrete X-Rays.

[BibT_eX]

[DOI]