Surrogate duality in a branch-and-bound procedure

DOI10.1002/nav.3800280107zbMath0453.90065OpenAlexW1987214277MaRDI QIDQ3901302

Ronald L. Rardin, Mark H. Karwan

Publication date: 1981

Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3800280107

zbMATH Keywords

computational efficiencysurrogate dualityrestarting procedureprimal branch- and-bound proceduresingle constrained integer programmingsurrogate multiplier search proceduressurrogate subproblems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10)

Related Items (4)

A new Lagrangian relaxation approach to the generalized assignment problem ⋮ A relax-and-cut algorithm for the set partitioning problem ⋮ Calculating surrogate constraints ⋮ On generalized surrogate duality in mixed-integer nonlinear programming

This page was built for publication: Surrogate duality in a branch-and-bound procedure