scientific article

From MaRDI portal

Revision as of 06:03, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3641981

Jump to:navigation, search

zbMath1183.90174MaRDI QIDQ3641981

Xingsan Qian, Guochun Tang, Caixia Jing

Publication date: 11 November 2009

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

zbMATH Keywords

computational complexity scheduling setup time polynomial algorithm multi-purpose machine

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3641981&oldid=17094331"