output
20022021
most citedFast optical layer mesh protection using pre-cross-connected trails

77 citations

Showing math.OCShow all

5 papers · 1 filter

math.OC2014★ 31 cited

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…

math.OC2012★ 15 cited

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…

math.OC2012★ 22 cited

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…

math.OC2009★ 5 cited

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…

math.OC2008★ 7 cited

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…