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

Network based heuristics for the set covering problem

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

zbMath0986.90044MaRDI QIDQ1580446

F. Djannaty, Kenneth Darby-Dowman

Publication date: 20 November 2000

Published in: Bulletin of the Iranian Mathematical Society (Search for Journal in Brave)


zbMATH Keywords

heuristicset covering problem


Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)


Related Items (1)

A computational approach to pivot selection in the LP relaxation of set problems




This page was built for publication: Network based heuristics for the set covering problem

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1580446&oldid=13869330"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 03:00.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki