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

Connectionist approaches for solver selection in constrained project scheduling

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

DOI10.1023/A:1018952406004zbMath0894.90086MaRDI QIDQ1368351

Rema Padman, Dan Zhu

Publication date: 28 September 1997

Published in: Annals of Operations Research (Search for Journal in Brave)


zbMATH Keywords

neural networksresource-constrained project schedulingconnectionist methods


Mathematics Subject Classification ID

Mixed integer programming (90C11) Nonlinear programming (90C30) Deterministic scheduling theory in operations research (90B35)


Related Items (4)

Unnamed Item ⋮ Knowledge integration using problem spaces: A study in resource-constrained project scheduling ⋮ Progress payments in project scheduling problems. ⋮ Simulated annealing and tabu search for multi-mode project payment scheduling


Uses Software

  • GAMS





This page was built for publication: Connectionist approaches for solver selection in constrained project scheduling

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1368351&oldid=13507715"
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 14:55.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki