A computational evaluation of two subgradient search methods

DOI10.1016/0305-0548(87)90027-XzbMath0618.90068OpenAlexW2000743687MaRDI QIDQ1089257

Mark H. Karwan, Sanjiv Sarin

Publication date: 1987

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(87)90027-x

zbMATH Keywords

Lagrangean relaxationoptimal Lagrange multipliersmodified subgradient search

Mathematics Subject Classification ID

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

Related Items (2)

A modified subgradient algorithm for Lagrangean relaxation ⋮ Lagrangean Relaxation-Based Techniques for Solving Facility Location Problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Surrogate duality in a branch-and-bound procedure for integer programming
• A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality
• A Multiplier Adjustment Method for the Generalized Assignment Problem
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Validation of subgradient optimization
• The Traveling-Salesman Problem and Minimum Spanning Trees

This page was built for publication: A computational evaluation of two subgradient search methods