NUMBERS OF PRIMAL AND DUAL BASES OF NETWORK FLOW AND UNIMODULAR INTEGER PROGRAMS

DOI10.15807/JORSJ.48.183MaRDI QIDQ5471479zbMATH OpenOpenAlexFDO

Authors Takayuki Ishizeki, Hiroki Nakayama, Hideki Imai

Publication date 14 June 2006

Published in Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL https://doi.org/10.15807/jorsj.48.183

zbMATH Keywords

computational algebraGröbner basisnetwork flownormalized volumestandard pair

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Integer programming (90C10) Programming involving graphs or networks (90C35)

Recommendations

• Primal integer programming
• Standard pairs for lawrence-type matrices and their applications to several lawrence-type integer programs
• On the number of bases of the transportation problem with prohibitions
• Counting integer flows in networks
• Polynomial-time primal simplex algorithms for the minimum cost network flow problem

This page was built for publication: NUMBERS OF PRIMAL AND DUAL BASES OF NETWORK FLOW AND UNIMODULAR INTEGER PROGRAMS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5471479)