Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Computational complexity of the problem of determining the set of indivisible resource exchange alternatives - MaRDI portal

Computational complexity of the problem of determining the set of indivisible resource exchange alternatives

From MaRDI portal

Publication:1835846

Jump to:navigation, search

zbMath0504.90054MaRDI QIDQ1835846

M. B. Katsnel'son, V. M. Temkin

Publication date: 1982

Published in: Automation and Remote Control (Search for Journal in Brave)

zbMATH Keywords

computational complexity equivalent traveling salesman problem network with arc gains NP-hard combinatorial problems optimal integral circulation problem optimal set of indivisible resource exchange alternatives

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10)

This page was built for publication: Computational complexity of the problem of determining the set of indivisible resource exchange alternatives

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