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

scientific article

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

zbMath1366.90186MaRDI QIDQ2928419

Wenyi Hong, Dong He, Zhen-bo Wang

Publication date: 7 November 2014

Full work available at URL: http://www.yokohamapublishers.jp/online2/oppjo/vol10/p577.html

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

approximation algorithmparallel machine schedulingcombination of optimization problemscovering problem


Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)


Related Items (2)

Vertex cover meets scheduling ⋮ Improved approximation algorithms for the combination problem of parallel machine scheduling and path






This page was built for publication:

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