A fixed point iterative approach to integer programming and its distributed computation

[1]  Yvonne Freeh,et al.  Interior Point Algorithms Theory And Analysis , 2016 .

[2]  C. Dang,et al.  Computational Models and Complexities of Tarski ’ s Fixed Points ∗ , 2011 .

[3]  Ailsa H. Land,et al.  An Automatic Method of Solving Discrete Programming Problems , 1960 .

[4]  M. Jünger,et al.  50 Years of Integer Programming 1958-2008 - From the Early Years to the State-of-the-Art , 2010 .

[5]  Chuangyin Dang,et al.  An Increasing-Mapping Approach to Integer Programming Based on Lexicographic Ordering and Linear Programming , 2010 .

[6]  Chuangyin Dang,et al.  An Arbitrary Starting Homotopy-Like Simplicial Algorithm for Computing an Integer Point in a Class of Polytopes , 2009, SIAM J. Discret. Math..

[7]  Samuel Burer,et al.  A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations , 2008, Math. Program..

[8]  J. D. Loera,et al.  Integer Polynomial Optimization in Fixed Dimension , 2004, Math. Oper. Res..

[9]  Dimitris Bertsimas,et al.  Optimization over integers , 2005 .

[10]  Arjen K. Lenstra,et al.  Solving a System of Linear Diophantine Equations with Lower and Upper Bounds on the Variables , 2000, Math. Oper. Res..

[11]  Milind Dawande,et al.  A Class of Hard Small 0-1 Programs , 1998, INFORMS J. Comput..

[12]  Chuangyin Dang,et al.  A Simplicial Approach to the Determination of an Integer Point of a Simplex , 1998, Math. Oper. Res..

[13]  George Havas,et al.  Extended GCD and Hermite Normal Form Algorithms via Lattice Basis Reduction , 1998, Exp. Math..

[14]  Shinji Mizuno,et al.  An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm , 1994, Math. Oper. Res..

[15]  Alexander I. Barvinok,et al.  A polynomial time algorithm for counting integral points in polyhedra when the dimension is fixed , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[16]  László Lovász,et al.  The Generalized Basis Reduction Algorithm , 1990, Math. Oper. Res..

[17]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988, Wiley interscience series in discrete mathematics and optimization.

[18]  David K. Smith.  Theory of Linear and Integer Programming , 1987 .

[19]  Herbert E. Scarf,et al.  Neighborhood Systems for Production Sets with Indivisibilities , 1986 .

[20]  Hendrik W. Lenstra,et al.  Integer Programming with a Fixed Number of Variables , 1983, Math. Oper. Res..

[21]  László Lovász,et al.  Factoring polynomials with rational coefficients , 1982 .

[22]  H. Scarf.  Production Sets with Indivisibilities Part I: Generalities , 1981 .

[23]  M. Garey.  Johnson: computers and intractability: a guide to the theory of np- completeness (freeman , 1979 .

[24]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[25]  Ralph E. Gomory,et al.  An algorithm for integer solutions to linear programs , 1958 .

[26]  A. Tarski.  A LATTICE-THEORETICAL FIXPOINT THEOREM AND ITS APPLICATIONS , 1955 .