## infinite group relaxation

swMATH ID: | 14600 |

Software Authors: | Basu, Amitabh; Hildebrand, Robert; Köppe, Matthias |

Description: | Light on the infinite group relaxation. I: Foundations and taxonomy. 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 groundbreaking papers titled {it Some continuous functions related to corner polyhedra I, II} (Math Program 3:23-85, 359-389, 1972a, b). The survey presents the infinite group problem in the modern context of cut generating functions. It focuses on the recent developments, such as algorithms for testing extremality and breakthroughs for the \(k\)-row problem for general \(kge 1\) that extend previous work on the single-row and two-row problems. The survey also includes some previously unpublished results; among other things, it unveils piecewise linear extreme functions with more than four different slopes. An interactive companion program, implemented in the open-source computer algebra package Sage, provides an updated compendium of known extreme functions. |

Homepage: | https://github.com/mkoeppe/infinite-group-relaxation-code |

Source Code: | https://github.com/mkoeppe/infinite-group-relaxation-code |

Dependencies: | sage |

Keywords: | cutting planes; cut-generating functions; minimal and extreme functions; integer programming; infinite group problem |

Related Software: | GitHub; cutgeneratingfunctionology; SageMath; MIPLIB; Normaliz; PPL; lifting; onerow; SCIP; PANDA; kepler98; PORTA; QEPCAD |

Cited in: | 25 Documents |

all
top 5

### Cited by 17 Authors

all
top 5

### Cited in 11 Serials

### Cited in 4 Fields

25 | Operations research, mathematical programming (90-XX) |

2 | Computer science (68-XX) |

1 | Approximations and expansions (41-XX) |

1 | Convex and discrete geometry (52-XX) |