N-fold integer programming

Discrete Optimization

Volumn 5, Issue 2, 2008, Pages 231-241

  De Loera, Jesús A ^a   Hemmecke, Raymond ^b   Onn, Shmuel ^c   Weismantel, Robert ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b OTTO VON GUERICKE UNIVERSITY   (Germany)

^c TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Augmentation; Bin packing; Combinatorial optimization; Computational complexity; Confidentiality; Contingency table; Cutting stock; Graver basis; Graver complexity; Hilbert basis; Integer programming; Markov basis; Markov complexity; Multiway table; n fold; Primal method; Privacy; Test set; Transportation polytope; Transportation problem

Indexed keywords

COMBINATORIAL OPTIMIZATION; COMPUTATIONAL COMPLEXITY; MARKOV PROCESSES; POLYNOMIALS; PROBLEM SOLVING;

AUGMENTATION; CONTINGENCY TABLES; GRAVER BASIS; GRAVER COMPLEXITY; HILBERT BASIS; INTEGER TRANSPORTATION; MARKOV COMPLEXITY; MULTIWAY TABLES; TRANSPORTATION POLYTOPE;

INTEGER PROGRAMMING;

EID: 41149099152     PISSN: 15725286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disopt.2006.06.006     Document Type: Article

References (25)

1. Aoki S., and Takemura A. Minimal basis for connected Markov chain over 3 × 3 × K contingency tables with fixed two-dimensional marginals. Aust. N. Z. J. Stat. 45 (2003) 229-249
2. Balinski M.L., and Rispoli F.J. Signature classes of transportation polytopes. Math. Program. A 60 (1993) 127-144
3. Cox L.H. Bounds on entries in 3-dimensional contingency tables. Inference Control in Statistical Databases - From Theory to Practice. Lec. Not. Comp. Sci. vol. 2316 (2002), Springer, New York 21-33
4. Cox L.H. On properties of multi-dimensional statistical tables. J. Statist. Plann. Inference 117 (2003) 251-273
5. De Loera J., and Onn S. The complexity of three-way statistical tables. SIAM J. Comput. 33 (2004) 819-836
6. De Loera J., and Onn S. All rational polytopes are transportation polytopes and all polytopal integer sets are contingency tables. Proc. 10th Ann. Math. Prog. Soc. Symp. Integ. Prog. Combin. Optim. (Columbia University, New York). Lec. Not. Comp. Sci. vol. 3064 (2004), Springer, New York 338-351
7. De Loera J., and Onn S. Markov bases of three-way tables are arbitrarily complicated. J. Symbolic Comput. 41 (2006) 173-181
8. De Loera J., and Onn S. All linear and integer programs are slim 3-way transportation programs. SIAM J. Optim. 17 (2006) 806-821
9. Duncan G.T., Fienberg S.E., Krishnan R., Padman R., and Roehrig S.F. Disclosure limitation methods and information loss for tabular data. In: Doyle P., Land J.I., Theeuwes J.M., and Zayatz L.V. (Eds). Confidentiality, Disclosure and Data Access: Theory and Practical Applications for Statistical Agencies (2001), North-Holland
10. Gilmore P.C., and Gomory R.E. A linear programming approach to the cutting-stock problem. Oper. Res. 9 (1961) 849-859
11. Graver J.E. On the foundation of linear and integer programming I. Math. Program. 9 (1975) 207-226
12. Hemmecke R. On the positive sum property and the computation of Graver test sets. Math. Program. 96 (2003) 247-269
13. R. Hemmecke, Exploiting symmetries in the computation of Graver bases. e-print: arXiv:math.CO/0410334 (2004)
14. R. Hemmecke, P. Malkin, 4ti2 Version 1.2 - Computation of Hilbert bases, Graver bases, toric Gröbner bases, and more. Available at: http://www.4ti2.de/, July 2005
15. Hoşten S., and Sullivant S. Finiteness theorems for Markov bases. J. Combin. Theory Ser. A 114 (2007) 311-321
16. Irving R., and Jerrum M.R. Three-dimensional statistical data security problems. SIAM J. Comput. 23 (1994) 170-184
17. Klee V., and Witzgall C. Facets and vertices of transportation polytopes. Mathematics of the Decision Sciences, Part I (Stanford, CA, 1967) (1968), AMS, Providence, RI 257-282
18. Lenstra Jr. H.W. Integer programming with a fixed number of variables. Math. Oper. Res. 8 (1983) 538-548
19. Onn S., and Rothblum U.G. Convex combinatorial optimization. Discrete Comput. Geom. 32 (2004) 549-566
20. Queyranne M., and Spieksma F.C.R. Approximation algorithms for multi-index transportation problems with decomposable costs. Discrete Appl. Math. 76 (1997) 239-253
21. Santos F., and Sturmfels B. Higher Lawrence configurations. J. Combin. Theory Ser. A 103 (2003) 151-164
22. Schrijver A. Theory of Linear and Integer Programming (1986), Wiley, New York
23. Schulz A., and Weismantel R. The complexity of generic primal algorithms for solving general integral programs. Math. Oper. Res. 27 (2002) 681-692
24. Vlach M. Conditions for the existence of solutions of the three-dimensional planar transportation problem. Discrete Appl. Math. 13 (1986) 61-78
25. Yemelichev V.A., Kovalev M.M., and Kravtsov M.K. Polytopes, Graphs and Optimisation (1984), Cambridge University Press, Cambridge