Quasi — Subgradient algorithms for calculating surrogate constraints

[1]  F. Glover.  A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem , 1965 .

[2]  Dennis L. Bricker.  Bounding a class of nonconvex linearly-constrained resource allocation problems via the surrogate dual , 1980, Math. Program..

[3]  R. Rardin,et al.  Surrogate duality in a branch‐and‐bound procedure , 1981 .

[4]  David G. Luenberger,et al.  Quasi-Convex Programming , 1968 .

[5]  B. J. Lageweg,et al.  Surrogate duality relaxation for job shop scheduling , 1983, Discret. Appl. Math..

[6]  W. Ziemba,et al.  Generalized concavity in optimization and economics , 1981 .

[8]  W. D. Northup,et al.  USING DUALITY TO SOLVE DISCRETE OPTIMIZATION PROBLEMS: THEORY AND COMPUTATIONAL EXPERIENCE* , 1975 .

[9]  G. Nemhauser,et al.  Integer Programming , 2020 .

[10]  Gary A. Kochenberger,et al.  Technical Note - An Implementation of Surrogate Constraint Duality , 1978, Oper. Res..

[11]  Harvey J. Greenberg,et al.  Surrogate Mathematical Programming , 1970, Oper. Res..

[12]  Harvey J. Greenberg,et al.  The Generalized Penalty-Function/Surrogate Model , 1973, Oper. Res..

[13]  Ronald L. Rardin,et al.  Surrogate Dual Multiplier Search Procedures in Integer Programming , 1984, Oper. Res..

[14]  Ronald L. Rardin,et al.  Some relationships between lagrangian and surrogate duality in integer programming , 1979, Math. Program..

[15]  Harvey J. Greenberg,et al.  A Review of Quasi-Convex Functions , 1971, Oper. Res..

[16]  Ronald L. Rardin,et al.  A new surrogate dual multiplier search procedure , 1987 .

[17]  Philip Wolfe,et al.  Validation of subgradient optimization , 1974, Math. Program..

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

[19]  Martin Dyer.  Calculating surrogate constraints , 1980, Math. Program..

[20]  A. M. Geoffrion.  Lagrangean Relaxation and Its Uses in Integer Programming , 1972 .