Solution of a tinned iron purchasing problem by Lagrangean relaxation

DOI10.1016/0377-2217(94)00004-VzbMath0906.90173MaRDI QIDQ1130077

B. Dorhout

Publication date: 16 August 1998

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

Lagrangean relaxationsubgradient techniquestinned iron purchasing problem

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Combinatorial optimization (90C27)

Cites Work

• An upper bound for the zero-one knapsack problem and a branch and bound algorithm
• Dioïds and semirings: Links to fuzzy sets and other applications
• Validation of subgradient optimization
• The traveling-salesman problem and minimum spanning trees: Part II
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Solution of a tinned iron purchasing problem by Lagrangean relaxation