Methods of Nonlinear 0-1 Programming

[1]  P. Hammer,et al.  Quadratic knapsack problems , 1980 .

[2]  H. D. Ratliff,et al.  A Cut Approach to the Rectilinear Distance Facility Location Problem , 1978, Oper. Res..

[3]  Spiros G. Papaioannou.  Optimal Test Generation in Combinational Networks by Pseudo-Boolean Programming , 1977, IEEE Transactions on Computers.

[4]  Masao Iri,et al.  Comments on F. Hadlock's Paper: "Finding a Maximum Cut of a Planar Graph in Polynomial Time" , 1977, SIAM J. Comput..

[5]  D. Granot,et al.  On Solving Fractional (0, 1) Programs By Implicit Enumeration , 1976 .

[6]  J. Picard.  Maximal Closure of a Graph and Applications to Combinatorial Problems , 1976 .

[7]  Pierre Hansen,et al.  Erratum: A Cascade Algorithm for the Logical Closure of a Set of Binary Relations , 1976, Information Processing Letters.

[8]  David S. Johnson,et al.  Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..

[9]  Willard I. Zangwill,et al.  Media Selection by Decision Programming , 1976 .

[10]  Gunter Bär.  Zur linearisierung beliebiger 0-1-optimierungsprobleme , 1976 .

[11]  F. Glover.  IMPROVED LINEAR INTEGER PROGRAMMING FORMULATIONS OF NONLINEAR INTEGER PROBLEMS , 1975 .

[12]  H. D. Ratliff,et al.  Minimum cuts and related problems , 1975, Networks.

[13]  A. L. Saipe.  Solving a (0, 1) hyperbolic program by branch and bound , 1975 .

[14]  F. Hadlock,et al.  Finding a Maximum Cut of a Planar Graph in Polynomial Time , 1975, SIAM J. Comput..

[15]  Mathematical methods of site selection for Electronic Message Systems (EMS) , 1975 .

[16]  Fred Glover,et al.  Surrogate Constraint Duality in Mathematical Programming , 1975, Oper. Res..

[17]  Mokhtar S. Bazaraa,et al.  A Cutting-Plane Algorithm for the Quadratic Set-Covering Problem , 1975, Oper. Res..

[18]  P. Hansen.  Les Procedures D’exploration et D’optimisation par Separation Et Evaluation , 1975 .

[19]  P. L. Hammer.  Boolean elements in combinatorial optimization : a survey , 1975 .

[20]  Fred W. Glover,et al.  Technical Note - Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program , 1974, Oper. Res..

[21]  H. P. Williams.  Experiments in the formulation of integer programming problems , 1974 .

[22]  Pierre Hansen,et al.  Programmes mathématiques en variables 0-1 , 1974 .

[23]  I.G. Rosenberg,et al.  Minimization of pseudo-boolean functions by binary development , 1974, Discret. Math..

[24]  H. D. Ratliff,et al.  Minimal Cost Cut Equivalent Networks , 1973 .

[25]  Fred W. Glover,et al.  Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming Problems , 1973, Oper. Res..

[26]  H. Donald Ratliff,et al.  A Graph-Theoretic Equivalence for Integer Programs , 1973, Oper. Res..

[27]  John A. Tomlin,et al.  An integer programming approach to a class of combinatorial problems , 1972, Math. Program..

[28]  Hamdy A. Taha.  Further Improvements in the Polynomial Zero-One Algorithm , 1972 .

[29]  Maurice Hanan,et al.  A review of the placement and quadratic assignment problems , 1972 .

[30]  Peter L. Hammer,et al.  On the Maximization of a Pseudo-Boolean Function , 1972, JACM.

[31]  Hamdy A. Taha,et al.  A Balasian-Based Algorithm for Zero-One Polynomial Programming , 1972 .

[32]  I. G. Rosenberg.  Brèves communications. 0-1 optimization and non-linear programming , 1972 .

[33]  Egon Balas,et al.  A duality theorem and an algorithm for (mixed-) integer nonlinear programming , 1971 .

[34]  M. Rao.  Cluster Analysis and Mathematical Programming , 1971 .

[35]  P. Robillard.  (0, 1) hyperbolic programming problems , 1971 .

[36]  Dan J. Laughhunn,et al.  Capital Expenditure Programming and Some Alternative Approaches to Risk , 1971 .

[37]  J. Rhys.  A Selection Problem of Shared Fixed Costs and Network Flows , 1970 .

[38]  M. Balinski.  Notes—On a Selection Problem , 1970 .

[39]  M. Desu.  A Selection Problem , 1970 .

[40]  A note on the dynamic planning of investment projects , 1970 .

[41]  D. J. Laughhunn.  Quadratic Binary Programming with Application to Capital-Budgeting Problems , 1970, Oper. Res..

[42]  Peter L. Hammer,et al.  Some remarks on quadratic programming with 0-1 variables , 1970 .

[43]  Sergiu Rudeanu.  Irredundant optimization of a pseudo-Boolean function , 1969 .

[44]  Victor Ginsburgh,et al.  Un algorithme de programmation quadratique en variables binaires , 1969 .

[45]  Sergiu Rudeanu,et al.  Programmation bivalente à plusieurs fonctions économiques , 1969 .

[46]  J. Abadie.  Une méthode arborescente pour les programmes non-linéaires partiellement discrets , 1969 .

[47]  James C. T. Mao,et al.  An Extension of Lawler and Bell's Method of Discrete Optimization with Examples from Capital Budgeting , 1968 .

[48]  Sergiu Rudeanu,et al.  Axiomatization of certain problems of minimization , 1967 .

[49]  Lawrence J. Watters.  Letter to the Editor - Reduction of Integer Polynomial Programming Problems to Zero-One Linear Programming Problems , 1967, Oper. Res..

[50]  Yrjö Seppälä.  Letter to the Editor - Choosing Among Investment Possibilities with Stochastic Pay-Off Minus Expenditure , 1967, Oper. Res..

[51]  Egon Balas.  DUALITY IN DISCRETE PROGRAMMING , 1967 .

[52]  E. L. Lawler,et al.  A Method for Solving Discrete Optimization Problems , 1966, Oper. Res..

[53]  H. Weingartner.  Capital Budgeting of Interrelated Projects: Survey and Synthesis , 1966 .

[54]  George L. Nemhauser,et al.  Scheduling to Minimize Interaction Cost , 1966, Oper. Res..

[55]  E. Balas.  An Additive Algorithm for Solving Linear Programs with Zero-One Variables , 1965 .

[56]  P. L. Ivanescu.  Some Network Flow Problems Solved with Pseudo-Boolean Programming , 1965 .

[57]  C. Witzgall,et al.  AN ALL-INTEGER PROGRAMMING ALGORITHM WITH PARABOLIC CONSTRAINTS* , 1963 .

[58]  E. Lawler.  The Quadratic Assignment Problem , 1963 .

[59]  J. E. Kelley,et al.  The Cutting-Plane Method for Solving Convex Programs , 1960 .

[60]  R. Fortet.  L’algebre de Boole et ses applications en recherche operationnelle , 1960 .