On simple combinatorial optimization problems. A collection of contributions in honour of Jack van Lint
type: Item
instance of: scholarly article
title: On simple combinatorial optimization problems. A collection of contributions in honour of Jack van Lint
zbMATH Open document ID: 0914.90226
DOI: 10.1016/0012-365X(92)90555-T
author: Alan J. Hoffman
published in: Discrete Mathematics
publication date: 1993-12-08T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C09
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 431044
zbMATH Keywords: greedy algorithm
zbMATH Keywords: covering
zbMATH Keywords: packing
zbMATH Keywords: shortest path
zbMATH Keywords: minimum spanning tree
MaRDI profile type: Publication
cites work: Q5514188
cites work: Q3737235
cites work: Totally-Balanced and Greedy Matrices
cites work: Greedy packing and series-parallel graphs
cites work: Q4040221
full work available at URL: 0012-365x(92)90555-t
OpenAlex ID: W4213257218
Recommended article: New perspectives of several fundamental problems in combinatorial optimization
Recommended article: On Approximate Solutions for Combinatorial Optimization Problems
Recommended article: Towards Copeland optimization in combinatorial problems
Recommended article: Q3836963
Recommended article: Solvable cases of a new combinatorial problem of optimization
Recommended article: Approximability of hard combinatorial optimization problems: an introduction
Recommended article: An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
Recommended article: A nonlinear approach to a class of combinatorial optimization problems
Recommended article: On combinatorial vector optimization problems
description: scientific article; zbMATH DE number 431044