Solution of a tinned iron purchasing problem by Lagrangean relaxation
type: Item
instance of: scholarly article
title: Solution of a tinned iron purchasing problem by Lagrangean relaxation
zbMATH Open document ID: 0906.90173
DOI: 10.1016/0377-2217(94)00004-V
author: B. Dorhout
published in: European Journal of Operational Research
publication date: 1998-08-16T00:00:00Z
Mathematics Subject Classification ID: 90C90
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 1191376
zbMATH Keywords: tinned iron purchasing problem
zbMATH Keywords: Lagrangean relaxation
zbMATH Keywords: subgradient techniques
MaRDI profile type: Publication
cites work: Q4133397
cites work: Q4178782
cites work: Dioïds and semirings: Links to fuzzy sets and other applications
cites work: The traveling-salesman problem and minimum spanning trees: Part II
cites work: Validation of subgradient optimization
cites work: An upper bound for the zero-one knapsack problem and a branch and bound algorithm
cites work: Q3738922
cites work: Q5566712
Recommended article: Raw material inventory solution in iron and steel industry using Lagrangian relaxation
Recommended article: Q3328287
Recommended article: Q4178782
Recommended article: Lagrangian Relaxation for Integer Programming
Recommended article: Q3142446
Recommended article: A Lagrangean relaxation method for the constrained assignment problem
Recommended article: An algorithm using Lagrangean relaxation and decomposition for solving a capacitated lot-sizing problem
Recommended article: Solving the fixed charge problem with Lagrangian relaxation and cost allocation heuristics
Recommended article: Capacitated lot-sizing and scheduling by Lagrangean relaxation
Recommended article: Lagrangian Relaxation and the Single-Source Capacitated Facility-Location Problem
description: scientific article; zbMATH DE number 1191376