77 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- ETH ZurichCH12 papers
- Institute of Theoretical Computer ScienceCH4 papers
- Royal Military College of CanadaCA3 papers
- University of California, DavisUS3 papers
- Charles UniversityCZ2 papers
- Johns Hopkins UniversityUS2 papers
- Aarhus UniversityDK1 paper
- École Polytechnique Fédérale de LausanneCH1 paper
- Institute for Biomedical EngineeringCH1 paper
- Technical University of MunichDE1 paper
- Technische Universität BerlinDE1 paper
- University of WashingtonUS1 paper
5 papers · 1 filter
Light on the Infinite Group Relaxation
Amitabh Basu, Robert Hildebrand, Matthias Köppe
This is a survey on the infinite group problem, an infinite-dimensional relaxation of integer linear optimization problems introduced by Ralph Gomory and Ellis Johnson in their gro…
Graver basis and proximity techniques for block-structured separable convex integer minimization problems
Raymond Hemmecke, Matthias Köppe, Robert Weismantel
We consider N-fold 4-block decomposable integer programs, which simultaneously generalize N-fold integer programs and two-stage stochastic integer programs with N scenarios. In pre…
Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem. I. The One-Dimensional Case
Amitabh Basu, Robert Hildebrand, Matthias Köppe
We give an algorithm for testing the extremality of minimal valid functions for Gomory and Johnson's infinite group problem that are piecewise linear (possibly discontinuous) with…
Combinatorial Characterizations of K-matrices
Jan Foniok, Komei Fukuda, Lorenz Klaus
We present a number of combinatorial characterizations of K-matrices. This extends a theorem of Fiedler and Ptak on linear-algebraic characterizations of K-matrices to the setting…
Pivoting in Linear Complementarity: Two Polynomial-Time Cases
Jan Foniok, Komei Fukuda, Bernd Gärtner +1
We study the behavior of simple principal pivoting methods for the P-matrix linear complementarity problem (P-LCP). We solve an open problem of Morris by showing that Murty's least…