Universal Gröbner basis associated with the maximum flow problem

DOI10.1007/s13160-012-0080-2zbMath1260.05071OpenAlexW2072289164MaRDI QIDQ1943084

Daisuke Ikegami, Yoshihide Watanabe, Sennosuke Watanabe

Publication date: 15 March 2013

Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s13160-012-0080-2

zbMATH Keywords

circuitmaximum flow problemuniversal Gröbner basis

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Directed graphs (digraphs), tournaments (05C20) Combinatorial aspects of simplicial complexes (05E45) Flows in graphs (05C21)

Uses Software

• GRIN

Cites Work

• Unnamed Item
• Unnamed Item
• Linear programming duality: an introduction to oriented matroids
• Test sets of integer programs
• Graphs, networks and algorithms. Based on the translation of the 3rd German edition by Tilla Schade in collaboration with the author
• Gröbner bases of lattices, corner polyhedra, and integer programming
• Sysygies of unimodular Lawrence ideals
• Combinatorial optimization. Theory and algorithms.