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

A problem of finding an acceptable variant in generalized project networks

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

DOI10.1155/JAMDS.2005.75zbMath1165.90654OpenAlexW2056215311MaRDI QIDQ930769

Gregory Gutin, Anders Yeo, David Blokh

Publication date: 1 July 2008

Published in: Journal of Applied Mathematics and Decision Sciences (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/130368


zbMATH Keywords

computational complexitymanagement


Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Case-oriented studies in operations research (90B90)








This page was built for publication: A problem of finding an acceptable variant in generalized project networks

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:930769&oldid=12903914"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 30 January 2024, at 17:42.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki