Huge multiway table problems

DOI10.1016/j.disopt.2014.07.003zbMath1308.90108arXiv1405.1189OpenAlexW2042842265MaRDI QIDQ2339833

Shmuel Onn

Publication date: 9 April 2015

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1405.1189

zbMATH Keywords

integer programmingGraver basismultiway tableinteger cone

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10)

Related Items

Huge Unimodular $n$-Fold Programs, Parameterized complexity of configuration integer programs, High-multiplicity \(N\)-fold IP via configuration LP, Combinatorial \(n\)-fold integer programming and applications, Unnamed Item

Cites Work

• A polynomial oracle-time algorithm for convex integer minimization
• A finiteness theorem for Markov bases of hierarchical models
• \(N\)-fold integer programming
• Nonlinear discrete optimization. An algorithmic theory
• Higher Lawrence configurations.
• \(n\)-fold integer programming in cubic time
• Carathéodory bounds for integer cones
• Integer Programming with a Fixed Number of Variables
• A Polynomial-Time Algorithm for Optimizing over N-Fold 4-Block Decomposable Integer Programs
• Minimal Basis for a Connected Markov Chain over 3 x 3 x K Contingency Tables with Fixed Two-Dimensional Marginals
• All Linear and Integer Programs Are Slim 3‐Way Transportation Programs