An implicit enumeration program for zero-one integer programming

DOI10.1007/BF01108520MaRDI QIDQ5675546zbMATH OpenFDO

Authors

Publication date 1972

Published in International Journal of Computer & Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01108520

Mathematics Subject Classification ID

Integer programming (90C10) Renewal theory (60K05)

Cites work

• scientific article; zbMATH DE number 3305071 (Why is no real title available?)
• A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
• An Additive Algorithm for Solving Linear Programs with Zero-One Variables
• An implicit enumeration program for zero-one integer programming
• Branch-and-Bound Methods: A Survey
• Direct Search Algorithms for Zero-One and Mixed-Integer Programming
• Discrete Programming by the Filter Method
• Integer Programming by Implicit Enumeration and Balas’ Method
• Integer Programming: Methods, Uses, Computations
• Surrogate Constraints
• Technical Note—Results in Using Gomory's All-Integer Integer Algorithm to Design Optimum Logic Networks
• The Traveling Salesman Problem: A Survey

Cited in

(3)

• Minimal covering problem and PLA minimization
• Zero-one integer programs with few contraints - lower bounding theory
• An implicit enumeration program for zero-one integer programming

This page was built for publication: An implicit enumeration program for zero-one integer programming

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