Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

scientific article; zbMATH DE number 3639146

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

zbMATH Open0411.68041MaRDI QIDQ4198059FDOQ4198059


Authors: Pierre Hansen, L. Kaufman, Marc-Paul Antoine Edit this on Wikidata


Publication date: 1978



Title of this publication is not available (Why is that?)




zbMATH Keywords

assignment probleminteger programmingNP-completeLagrangian relaxationSchedulingassigning colors to the vertices of a graphassignment of jobs to machinesBranch-and-Bound algorithmminimizing processing cost


Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Interior-point methods (90C51) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Coloring of graphs and hypergraphs (05C15)







This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4198059)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4198059&oldid=18046127"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 6 February 2024, at 13:20. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki