A single-branch implicit enumeration algorithm for zero-one programs with geometrical constraints

DOI10.1016/0305-0548(84)90020-0zbMath0607.90049OpenAlexW2089774004MaRDI QIDQ1085782

R. Michael Harnett

Publication date: 1984

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(84)90020-0

zbMATH Keywords

geometrical constraintsdecomposition to additive subproblemsmilitary management

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Boolean programming (90C09) Operations research and management science (90B99)

Related Items (1)

A single-branch implicit enumeration algorithm for zero-one programs with geometrical constraints

Cites Work

• A single-branch implicit enumeration algorithm for zero-one programs with geometrical constraints
• A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
• An Additive Algorithm for Solving Linear Programs with Zero-One Variables

This page was built for publication: A single-branch implicit enumeration algorithm for zero-one programs with geometrical constraints