Use of primal-dual technique in the network algorithm for two-way contingency tables

DOI10.1007/BF03167480zbMath1059.62060MaRDI QIDQ1774297

Taiji Suzuki, Kazuo Murota, Satoshi Aoki

Publication date: 29 April 2005

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

zbMATH Keywords

minimum cost flowprimal-dual algorithmdiscrete convexity

Mathematics Subject Classification ID

Convex programming (90C25) Applications of mathematical programming (90C90) Contingency tables (62H17)

Related Items (1)

Minimal invariant Markov basis for sampling contingency tables with fixed marginals

Uses Software

• FEXACT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• ALGORITHM 643
• A Network Algorithm for Performing Fisher's Exact Test in r × c Contingency Tables
• An ordering of dependence for contingency tables
• A survey of exact inference for contingency tables. With comments and a rejoinder by the author
• Extreme probabilities for contingency tables under row and column independence with application to fisher's exact test
• Solving integer minimum cost flows with separable convex cost objective polynomially
• A remark on algorithm 643: FEXACT
• Discrete Convex Analysis
• NOTE ON AN EXACT TREATMENT OF CONTINGENCY, GOODNESS OF FIT AND OTHER PROBLEMS OF SIGNIFICANCE

This page was built for publication: Use of primal-dual technique in the network algorithm for two-way contingency tables