Future paths for integer programming and links to artificial intelligence

Garfinkel, 1972 Lawler, 1976 Papadimitriou, 1982 Rockafellar, 1970 Salkin, 1975 Sherali, 1980, Optimization with Disjunctive Constraints, Vol. 81 Zionts, 1974 Balas, 1979, Disjunctive programming, 3 Bradley, 1974, Coefficient reduction for inequalities in 0–1 variables, Math. Progr., 7, 263, 10.1007/BF01585527 Crowder, 1983, Solving large scale 0–1 linear programming problems, Opns Res., 31, 803, 10.1287/opre.31.5.803 Guignard, 1977, Propagation, penalty improvement and use of logical inequalities, Math. Opns Res., 25, 157 Padberg, 1982, Covering, packing and knapsack problems, Ann. Discr. Math., 4, 265, 10.1016/S0167-5060(08)70831-8 van Roy, 1984, A software system for mixed integer programming by reformulating automatically using cuts. Talk at session TA7 Wolsey, 1976, Facets and strong valid inequalities for integer programs, Opns Res., 24, 367, 10.1287/opre.24.2.367 Balas, 1983, Disjunctive programming and a hierarch of relaxations for discrete optimization problems Bazaraa, 1976 Geoffrion, 1974, Lagrangean relaxation for integer programming, 10.1007/BFb0120690 Held, 1974, Validation of subgradient optimization, Math. Progr., 6, 62, 10.1007/BF01580223 Karwan, 1979, Some relationships between Lagrangian and surrogate duality in integer programming, Math. Progr., 18, 320, 10.1007/BF01588253 Lasdon, 1970 Fisher, 1981, A computerized vehicle routing application Gavish, 1985, Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality, Math. Progr., 31, 78, 10.1007/BF02591863 Geoffrion, 1974, Multicommidity distribution system design by benders decomposition, Mgmt Sci., 20, 822, 10.1287/mnsc.20.5.822 Glover, 1984, Integrating modeling, algorithm design and computational implementation to solve a large scale nonlinear mixed integer problem Mulvey, 1979, Cluster analysis: an application of Lagrangian relaxation, Mgmt Sci., 25, 329, 10.1287/mnsc.25.4.329 Balas, 1975, Disjunctive programming: cutting-planes from logical conditions, Vol. 2, 279 Jeroslow, 1977, Cutting-plane theory: disjunctive methods, Ann. Discr. Math., I, 293, 10.1016/S0167-5060(08)70741-6 Jeroslow, 1984 Jeroslow, 1985 Meyer, 1975, Integer and mixed-integer programming models: general properties, J. Opt. Theory Appl., 16, 191, 10.1007/BF01262932 Glover, 1979, Improved computer-based planning techniques, Interfaces, 9, 12, 10.1287/inte.9.4.12 Glover, 1984, A netform system for resource planning in the U.S. Bureau of Land Management, J. Opl Res. Soc., 35, 605, 10.1057/jors.1984.124 Greenberg, 1979, A new approach to analyze information contained in a model, 517 Greenberg, 1981 Glover, 1986, The general employee scheduling problem: an integration of MS and AI, Comput. Opns Res., 13, 563, 10.1016/0305-0548(86)90050-X Johnson, 1985, Optimization by simulated annealing: a tutorial. AT&T Bell Laboratories Kirkpatrick, 1983, Optimization by simulated annealing, Science, 220, 671, 10.1126/science.220.4598.671 Metropolis, 1953, Equation of state calculations by fast computing machines, J. chem. Phys., 21, 1087, 10.1063/1.1699114 Golden, 1984, Using simulated annealing to solve routing and location problems, University of Maryland, College of Business and Management, Working Paper Series MS/S 84-001 Romeo, 1985 Crowston, 1964 Glover, 1964 Lin, 1965, Computer solutions to the traveling salesman problem, Bell Syst. Tech. J., 44, 2245, 10.1002/j.1538-7305.1965.tb04146.x Golden, 1985, The empirical analysis of TSP heuristics Krolak, 1971, A man-machine approach toward solving the traveling salesman problem, Commun. ACM, 14, 327, 10.1145/362588.362593 1985 Thompson, 1985 Glover, 1977, Heuristics for integer programming using surrogate constraints, Decis. Sci., 8, 156, 10.1111/j.1540-5915.1977.tb01074.x Trauth, 1966, Practical aspects of integer linear programming, Sandia Corporation Monograph, SC-R-66-925 Bazaraa, 1977, On the use of fictitious bounds in tree search algorithms, Mgmt Sci., 23, 904, 10.1287/mnsc.23.8.904 Glover, 1978, Parametric branch and bound, Omega, 6, 145, 10.1016/0305-0483(78)90022-1 Glover, 1976, Dynamic Strategies for branch and bound, Omega, 4, 571, 10.1016/0305-0483(76)90007-4 Kostreva, 1980, Adaptive estimates improve binary programming Marsten, 1984 Marsten, 1985, Using a posteriori bounds to improve the performance of branch-and-bound algorithms Mitra, 1973, Investigation of some branch-and-bound strategies for the solution of mixed-integer programs, Math. Progr., 4, 155, 10.1007/BF01584658 Anderson, 1983 Barr, 1981, Volume I Nilsson, 1980 Pearl, 1984 Rich, 1983 Winston, 1984 Dantzig, 1963 Courtois, 1977 Simon, 1969 Simon, 1961, Aggregation of variables in dynamic systems, Econometrica, 29, 111, 10.2307/1909285 Bixby, 1984, Recent algorithms for two versions of graph realization and remarks on applications to linear programming, 39 Bixby, 1980, Converting linear programs to network problems, Math. Opns Res., 5, 321, 10.1287/moor.5.3.321 Bixby, 1985, An almost linear-time algorithm for graph realization, 10.21236/ADA455177 Brown, 1985, Extracting embedded generalized networks from linear programming problems, Math. Progr., 32, 11, 10.1007/BF01585656 Schrage, 1981, On hidden structures in linear programs Truemper, 1983, How to detect hidden networks and totally-unimodular subsections of linear programs Ali, 1984, Reoptimization procedures for bounded variable primal simplex network algorithms Ali, 1985, The equal flow problem Chen, 1985, A primal simplex approach to pure processing networks M. Engquist and C. H. Hen, Computational comparison of two solution procedures for allocation/processing networks. To be published in Math. Progr. Study. McBride, 1982, Solving generalized processing network problems McBride, 1985, Solving embedded generalized network problems, Eur. J. Opns Res., 21, 82, 10.1016/0377-2217(85)90091-8 Rockafellar, 1984, Network Flows and Monotropic Optimization Glover, 1965, A multiphase-dual algorithm for the zero-one integer programming problem, Opns Res., 13, 879, 10.1287/opre.13.6.879 Hammer, 1977 Hammer, 1975, Facets of regular 0–1 polytopes, Math. Progr., 8, 179, 10.1007/BF01580442 Glover, 1980, Equivalence of the 0–1 integer programming problem to discrete generalized and pure networks, Opns Res., 28, 829, 10.1287/opre.28.3.829 Srinivasan, 1974, Stopped simplex algorithm for the set partitioning problem with transportation-like subproblems Glover, 1984, Layering strategies of creating exploitable structure in linear and integer programs Guignard-Spielberg, 1984, Lagrangean decomposition: an improvement over Lagragean and surrogate duals Glover, 1985, Interactive decision software and computer graphics for architectural and space planning, 10.1007/BF02023611 Senju, 1968, An approach to linear programming with 0–1 variables, Mgmt Sci., 15, B196, 10.1287/mnsc.15.4.B196 Kochenberger, 1974, A heuristic for general integer programming, Decis. Sci., 5, 36, 10.1111/j.1540-5915.1974.tb00593.x Arthanari, 1981 Bajgier, 1982, An experimental comparison of statistical and linear programming approaches to the discriminant problem, Decis. Sci., 13, 604, 10.1111/j.1540-5915.1982.tb01185.x N. Freed and F. Glover, Evaluating alternative linear programming approaches to the discriminant problem. MSRS 85-5, University of Colorado. To be published in Decis. Sci. Liittschwager, 1978, Integer programming solution of a classification problem, Mgmt Sci., 24, 1515, 10.1287/mnsc.24.14.1515 Rao, 1971, Cluster analysis and mathematical programming, J. Am. statist. Ass., 66, 622, 10.2307/2283542 Williams, 1978 Christofides, 1972, Algorithm for large scale TSP's, Opns Res. Q., 23, 511, 10.1057/jors.1972.79