Light on the infinite group relaxation II: sufficient conditions for extremality, sequences, and algorithms
Light on the infinite group relaxation II: sufficient conditions for extremality, sequences, and algorithms
复制标题
浅谈无限群弛豫 II:极值、序列和算法的充分条件
DOI:
--
复制
发表时间:
2015
期刊:
影响因子:
--
通讯作者:
M. Köppe
中科院分区:
文献类型:
--
作者:
A. Basu;R. Hildebrand;M. Köppe
This is the second part of 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 Some continuous functions related to corner polyhedra I, II (Math Program 3:23–85, 1972a; Math Program 3:359–389, 1972b). 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 k≥1documentclass[12pt]{minimal} usepackage{amsmath} usepackage{wasysym} usepackage{amsfonts} usepackage{amssymb} usepackage{amsbsy} usepackage{mathrsfs} usepackage{upgreek} setlength{oddsidemargin}{-69pt} egin{document}$$kge 1$$end{document} 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.