scientific article

From MaRDI portal

Revision as of 23:51, 29 January 2024 by Import240129110155 (talk | contribs) (Created automatically from import240129110155)

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

Publication:3984073

Jump to:navigation, search

zbMath0741.90095MaRDI QIDQ3984073

Xiufeng Du, Ding-Zhu Du

Publication date: 27 June 1992

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

zbMATH Keywords

NP-completeness existence of polynomial time heuristics

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (1)

On complexity of subset interconnection designs

This page was built for publication:

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