A greedy algorithm for maximizing a linear objective function

DOI10.1016/S0166-218X(02)00311-6zbMath1028.90030MaRDI QIDQ2773612

V. V. Shenmajer

Publication date: 24 February 2002

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

matroidindependence systemgreedoid

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Combinatorial optimization (90C27)

Related Items (3)

Two algorithms for a class of elliptic problems in shape optimization ⋮ Problems on independence systems solvable by the greedy algorithm ⋮ Greedy algorithms for eigenvalue optimization problems in shape design of two-density inhomogeneous materials

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear objective functions on certain classes of greedoids
• Note on Independence Functions
• Optimal assignments in an ordered set: An application of matroid theory
• Matroids and the greedy algorithm

This page was built for publication: A greedy algorithm for maximizing a linear objective function