New computer-based search strategies for extreme functions of the Gomory–Johnson infinite group problem

Matthias Köppe; Yuan Zhou

doi:10.1007/s12532-016-0115-9

New computer-based search strategies for extreme functions of the Gomory–Johnson infinite group problem

Matthias Köppe, Yuan Zhou

Mathematics

Research output: Contribution to journal › Article › peer-review

7 Scopus citations

Abstract

We describe new computer-based search strategies for extreme functions for the Gomory–Johnson infinite group problem. They lead to the discovery of new extreme functions, whose existence settles several open questions.

Original language	English
Pages (from-to)	419-469
Number of pages	51
Journal	Mathematical Programming Computation
Volume	9
Issue number	3
DOIs	https://doi.org/10.1007/s12532-016-0115-9
State	Published - Sep 1 2017

Bibliographical note

Funding Information:
The authors acknowledge partial support from the National Science Foundation through Grant DMS-1320051 awarded to M. Köppe.

Publisher Copyright:
© 2016, Springer-Verlag Berlin Heidelberg and The Mathematical Programming Society.

Keywords

90C10

ASJC Scopus subject areas

Theoretical Computer Science
Software

Access to Document

10.1007/s12532-016-0115-9

Cite this

@article{973dd908c69540f4afe38fd4b57366ac,

title = "New computer-based search strategies for extreme functions of the Gomory–Johnson infinite group problem",

abstract = "We describe new computer-based search strategies for extreme functions for the Gomory–Johnson infinite group problem. They lead to the discovery of new extreme functions, whose existence settles several open questions.",

keywords = "90C10",

author = "Matthias K{\"o}ppe and Yuan Zhou",

note = "Funding Information: The authors acknowledge partial support from the National Science Foundation through Grant DMS-1320051 awarded to M. K{\"o}ppe. Publisher Copyright: {\textcopyright} 2016, Springer-Verlag Berlin Heidelberg and The Mathematical Programming Society.",

year = "2017",

month = sep,

day = "1",

doi = "10.1007/s12532-016-0115-9",

language = "English",

volume = "9",

pages = "419--469",

number = "3",

}

TY - JOUR

T1 - New computer-based search strategies for extreme functions of the Gomory–Johnson infinite group problem

AU - Köppe, Matthias

AU - Zhou, Yuan

N1 - Funding Information: The authors acknowledge partial support from the National Science Foundation through Grant DMS-1320051 awarded to M. Köppe. Publisher Copyright: © 2016, Springer-Verlag Berlin Heidelberg and The Mathematical Programming Society.

PY - 2017/9/1

Y1 - 2017/9/1

N2 - We describe new computer-based search strategies for extreme functions for the Gomory–Johnson infinite group problem. They lead to the discovery of new extreme functions, whose existence settles several open questions.

AB - We describe new computer-based search strategies for extreme functions for the Gomory–Johnson infinite group problem. They lead to the discovery of new extreme functions, whose existence settles several open questions.

KW - 90C10

UR - http://www.scopus.com/inward/record.url?scp=85026807811&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85026807811&partnerID=8YFLogxK

U2 - 10.1007/s12532-016-0115-9

DO - 10.1007/s12532-016-0115-9

M3 - Article

AN - SCOPUS:85026807811

SN - 1867-2949

VL - 9

SP - 419

EP - 469

JO - Mathematical Programming Computation

JF - Mathematical Programming Computation

IS - 3

ER -

New computer-based search strategies for extreme functions of the Gomory–Johnson infinite group problem

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this