Zero-one programming using non-binary tree-search

DOI10.1093/COMJNL/14.4.418MaRDI QIDQ5635255zbMATH OpenOpenAlexFDO

Authors 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)

Cited in

(3)

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

This page was built for publication: Zero-one programming using non-binary tree-search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5635255)