Q4040299
type: Item
instance of: scholarly article
zbMATH Open document ID: 0652.90068
author: R. G. Parker
author: Ronald L. Rardin
publication date: 1993-06-05T00:00:00Z
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90-01
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 05B35
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68Rxx
zbMATH DE Number: 193499
zbMATH Keywords: exact and nonexact algorithms
zbMATH Keywords: nonpolynomial algorithms
zbMATH Keywords: time complexity
zbMATH Keywords: computability
zbMATH Keywords: worst-case analysis
zbMATH Keywords: matroids
zbMATH Keywords: time-polynomial algorithms
zbMATH Keywords: partial enumeration
zbMATH Keywords: Lagrangian dual ideas
zbMATH Keywords: Benders' decomposition
zbMATH Keywords: cutting methods
zbMATH Keywords: heuristic procedures
zbMATH Keywords: greedy
zbMATH Keywords: local search
zbMATH Keywords: truncated exponential algorithms
MaRDI profile type: Publication
description: scientific article