Dual formulations and subgradient optimization strategies for linear programming relaxations of mixed-integer programs
- 31 May 1988
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 20 (1) , 51-68
- https://doi.org/10.1016/0166-218x(88)90041-8
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- On the choice of step size in subgradient optimizationEuropean Journal of Operational Research, 1981
- A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian dualityEuropean Journal of Operational Research, 1979
- On obtaining the ‘best’ multipliers for a lagrangean relaxation for integer programmingComputers & Operations Research, 1978
- A method of conjugate subgradients for minimizing nondifferentiable functionsPublished by Springer Nature ,1975
- On improving relaxation methods by modified gradient techniquesPublished by Springer Nature ,1975
- Lagrangean relaxation for integer programmingPublished by Springer Nature ,1974
- The traveling-salesman problem and minimum spanning trees: Part IIMathematical Programming, 1971
- Minimization of unsmooth functionalsUSSR Computational Mathematics and Mathematical Physics, 1969
- Pracniques: construction of nonlinear programming test problemsCommunications of the ACM, 1965
- `` Direct Search'' Solution of Numerical and Statistical ProblemsJournal of the ACM, 1961