Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A greedy algorithm for some classes of integer programs.

From MaRDI portal
Publication:1417561
Jump to:navigation, search

DOI10.1016/S0166-218X(03)00435-9zbMath1053.90099MaRDI QIDQ1417561

V. V. Shenmaier

Publication date: 5 January 2004

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


zbMATH Keywords

greedy algorithmmatroidsgreedoidsseparable function


Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial aspects of matroids and geometric lattices (05B35)


Related Items

A general model for matroids and the greedy algorithm



Cites Work

  • Unnamed Item
  • Unnamed Item
  • Linear objective functions on certain classes of greedoids
  • Submodular functions and optimization
  • Well-layered maps---a class of greedily optimizable set functions
  • Note on Independence Functions
  • An Exact Characterization of Greedy Structures
  • Matroids and the greedy algorithm
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1417561&oldid=13586511"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 18:19.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki