An Algebraic Perspective of Group Relaxations

2001/10/03 by Rekha R. Thomas, Thomas, Rekha R.
Computer Science · Mathematics · #05-02 #90-02 #Advanced Graph Theory Research #Combinatorics (math.CO) #Commutative Algebra and Its Applications #FOS: Mathematics #Optimization and Control (math.OC) #Polynomial and algebraic computation #math.CO #math.OC #msc:05-02 #msc:90-02

paper · pdf · doi:10.48550/arxiv.math/0110034

36 pages

arxiv created 2001/10/03 · openalex publication_date 2001/10/03 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

This is an expository article on recent developments in the theory of group relaxations in integer programming from an algebraic perspective.

Related

• Certificates and relaxations for integer programming and the semi-group membership problem
• Algebraic Relaxations and Hardness Results in Polynomial Optimization and Lyapunov Analysis
• Symmetries in Integer Programs
• Gomory Integer Programs
• Asymptotic behavior of Integer Programming and the stability of the Castelnuovo-Mumford regularity