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 branch-and-bound algorithm for one class of scheduling problem

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

zbMath0791.90029MaRDI QIDQ1311598

V. G. Anisimov, E. G. Anisimov

Publication date: 3 March 1994

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)


zbMATH Keywords

branch-and-boundoptimal distribution of discrete heterogeneous resources on a network


Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35)








This page was built for publication: A branch-and-bound algorithm for one class of scheduling problem

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