Encyclopedia of Optimization, Second Edition

Introduction Phylogenetic Analysis Methods Based on Pairwise Distance ParsimonyMethods Maximum LikelihoodMethods Multiple Sequence Alignment Scoring Alignment Alignment Approaches Progressive Algorithms Graph-Based Algorithms Iterative Algorithms Novel Graph-Theoretical Genomic Models Definitions Construction of a Conflict Graph from Paths of Multiple Sequences Complexity Theory Special Cases of MWCMS Computational Models: Integer Programming Formulation Summary Acknowledgement References

[1]  A. Manne.  Plant Location Under Economies-of-Scale---Decentralization and Computation , 1964 .

[2]  Rekha R. Thomas.  A Geometric Buchberger Algorithm for Integer Programming , 1995, Math. Oper. Res..

[3]  Bernd Sturmfels,et al.  Gröbner bases of lattices, corner polyhedra, and integer programming. , 1995 .

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

[5]  A. M. Rubinov.  Monotonic analysis: convergence of sequences of monotone functions , 2003 .

[6]  Алексей Дмитриевич Коршунов,et al.  Монотонные булевы функции@@@Monotone Boolean functions , 2003 .

[7]  Toshihide Ibaraki,et al.  The Maximum Latency and Identification of Positive Boolean Functions , 1994, SIAM J. Comput..

[8]  C. G. Broyden.  On the numerical stability of Huang's and related methods , 1985 .

[9]  Rekha R. Thomas,et al.  Truncated Gröbner Bases for Integer Programming , 1997, Applicable Algebra in Engineering, Communication and Computing.

[10]  Kurt Spielberg,et al.  Algorithms for the Simple Plant-Location Problem with Some Side Conditions , 1969, Oper. Res..

[11]  Sartaj Sahni,et al.  Approximate Algorithms for the 0/1 Knapsack Problem , 1975, JACM.

[12]  Evangelos Triantaphyllou,et al.  Interactive Learning of Monotone Boolean Functions , 1996, Inf. Sci..

[13]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[14]  Winfrid G. Schneeweiss,et al.  Boolean functions - with engineering applications and computer programs , 1989 .

[15]  Eva K. Lee,et al.  COMPUTATIONAL EXPERIENCE OF AN INTERIOR-POINT SQP ALGORITHM IN A PARALLEL BRANCH-AND-BOUND FRAMEWORK , 2000 .

[16]  Rekha R. Thomas,et al.  An algebraic geometry algorithm for scheduling in presence of setups and correlated demands , 1995, Math. Program..

[17]  Gautam Mitra.  Investigation of some branch and bound strategies for the solution of mixed integer linear programs , 1973, Math. Program..

[18]  Ilya Shmulevich.  Properties and applications of monotone Boolean functions and stack filters , 1997 .

[19]  A. Rubinov.  Abstract Convexity and Global Optimization , 2000 .

[20]  A. Galantai.  Analysis of error propagation in the ABS class for linear systems , 1991 .

[21]  Alfred A. Kuehn,et al.  A Heuristic Program for Locating Warehouses , 1963 .

[22]  Boris Kovalerchuk,et al.  MONOTONE BOOLEAN FUNCTION LEARNING TECHNIQUES INTEGRATED WITH USER INTERACTION , 2003 .

[23]  Rekha R. Thomas,et al.  Variation of cost functions in integer programming , 1997, Math. Program..

[24]  N. A. Sokolov.  On the optimal evaluation of monotonic Boolean functions , 1982 .

[25]  Winfrid G. Schneeweiss.  A Necessary and Sufficient Criterion for the Monotonicity of Boolean Functions with Deterministic and Stochastic , 1996, IEEE Trans. Computers.

[26]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[27]  Günter M. Ziegler,et al.  A Variant of the Buchberger Algorithm for Integer Programming , 1997, SIAM J. Discret. Math..

[28]  Donald Goldfarb,et al.  A numerically stable dual method for solving strictly convex quadratic programs , 1983, Math. Program..

[29]  Sergiu Rudeanu.  Boolean functions and equations , 1974 .

[30]  Emilio Spedicato,et al.  Solution of linear least squares via the ABS algorithm , 1993, Math. Program..

[31]  Evangelos Triantaphyllou,et al.  Minimizing the Average Query Complexity of Learning Monotone Boolean Functions , 2002, INFORMS J. Comput..

[32]  I. Singer,et al.  Topical and sub-topical functions, downward sets and abstract convexity , 2001 .

[33]  Oscar H. Ibarra,et al.  Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems , 1975, JACM.

[34]  A. M. Rubinov,et al.  Best Approximation by Normal and Conormal Sets , 2000 .

[35]  Manfred W. Padberg,et al.  A branch-and-cut approach to a traveling salesman problem with side constraints , 1989 .

[36]  Juan Enrique Martínez-Legaz,et al.  Monotonic analysis over cones: II , 2004 .

[37]  J. Dennis,et al.  Generalized conjugate directions , 1987 .

[38]  A. Land,et al.  Computer Codes for Problems of Integer Programming , 1979 .

[39]  W. W. Sharkey.  Convex games without side payments , 1981 .

[40]  E. Spedicato,et al.  A class of direct methods for linear systems , 1984 .

[41]  Maria Teresa Vespucci,et al.  A bibliography on the ABS methods , 1992 .

[42]  Roy E. Marsten,et al.  Feature Article - Interior Point Methods for Linear Programming: Computational State of the Art , 1994, INFORMS J. Comput..

[43]  Giovanni Rinaldi,et al.  A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems , 1991, SIAM Rev..

[44]  David Abramson,et al.  A Parallel Interior Point Method and Its Application to Facility Location Problems , 1998, Comput. Optim. Appl..

[45]  Emilio Spedicato,et al.  Solving linear least squares by orthogonal factorization and pseudoinverse computation via the modified Huang algorithm in the ABS class , 2005, Computing.

[46]  Koichi Yamamoto.  Note on the Order of Free Distributive Lattices , 1953 .

[47]  H. Mohebi,et al.  Monotonic analysis over ordered topological vector spaces: I , 2007 .

[48]  John E. Mitchell,et al.  Computational Experience in Nonlinear Mixed Integer Programming , 1997 .

[49]  J. Dutta,et al.  Monotonic Analysis over Cones: I , 2004 .