Computational complexity of the problem of choosing exchange alternatives with a limited number of indivisible resources

Publication date: 1983

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

computational complexity NP-hardness combinatorial programming housing market management indivisible resources optimal set of exchange alternatives vertex covering of a graph

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) General equilibrium theory (91B50) Boolean programming (90C09)

This page was built for publication: Computational complexity of the problem of choosing exchange alternatives with a limited number of indivisible resources