Zero-one programming using non-binary tree-search

DOI10.1093/comjnl/14.4.418zbMath0227.90034OpenAlexW2124940271MaRDI QIDQ5635255

Nicos Christofides

Publication date: 1971

Published in: The Computer Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/comjnl/14.4.418

Mathematics Subject Classification ID

Boolean programming (90C09)

Related Items

A binary cat swarm optimization algorithm for the non-unicost set covering problem ⋮ Enhancing an algorithm for set covering problems ⋮ Algorithms for large scale set covering problems