Branch-and-bound procedure and state—space representation of combinatorial optimization problems
From MaRDI portal
Publication:4146584
DOI10.1016/S0019-9958(78)90197-3zbMath0369.90127MaRDI QIDQ4146584
Publication date: 1978
Published in: Information and Control (Search for Journal in Brave)
Decision theory (91B06) Applications of mathematical programming (90C90) Integer programming (90C10)
Related Items
A unifying approach to heuristic search, Branch-and-bound as a higher-order function, A general branch and bound formulation for understanding and synthesizing And/Or tree search procedures, General branch and bound, and its relation to \(A^*\) and \(AO^*\), The application of automated reasoning to formal models of combinatorial optimization
