论文信息 - Solving nonlinear integer programs with large-scale optimization software

Solving nonlinear integer programs with large-scale optimization software

This paper describes recent experience in tackling large nonlinear integer programming problems using the MINOS large-scale optimization software. A technique is presented for extending the constrained search approach used in MINOS to exploring integer-feasible solutions once a continuous optimal solution is obtained. Computational experience with this approach is described for two classes of problems: quadratic assignment problems and pipeline network design problems.

B. A. Murtagh | H. Mawengkang | B. Murtagh | H. Mawengkang

[1] Michael A. Saunders,et al. MINOS/AUGMENTED User's Manual. , 1980 .

[2] J. H. Ahrens,et al. Suboptimal algorithms for the quadratic assignment problem , 1968 .

[3] Leon Steinberg,et al. The Backboard Wiring Problem: A Placement Algorithm , 1961 .

[4] B. Murtagh,et al. A heuristic procedure for solving the quadratic assignment problem , 1982 .

[5] Michael A. Saunders,et al. Large-scale linearly constrained optimization , 1978, Math. Program..

[6] P. Hansen. Methods of Nonlinear 0-1 Programming , 1979 .

[7] A. N. Elshafei,et al. Hospital Layout as a Quadratic Assignment Problem , 1977 .

[8] M. W. Cooper. A Survey of Methods for Pure Nonlinear Integer Programming , 1981 .

[9] Egon Balas,et al. Nonlinear 0–1 programming: II. Dominance relations and algorithms , 1983, Math. Program..

[10] Michael A. Saunders,et al. A projected Lagrangian algorithm and its implementation for sparse nonlinear constraints , 1982 .

[11] R. Burkard,et al. Numerical investigations on quadratic assignment problems , 1978 .

[12] Egon Balas,et al. Nonlinear 0–1 programming: I. Linearization techniques , 1984, Math. Program..