An implicit enumeration program for zero-one integer programming
From MaRDI portal
Publication:5675546
DOI10.1007/BF01108520zbMath0258.90035MaRDI QIDQ5675546
No author found.
Publication date: 1972
Published in: International Journal of Computer & Information Sciences (Search for Journal in Brave)
Related Items
Minimal covering problem and PLA minimization, An implicit enumeration program for zero-one integer programming, Zero-one integer programs with few contraints - lower bounding theory
Cites Work
- Unnamed Item
- Integer Programming: Methods, Uses, Computations
- Branch-and-Bound Methods: A Survey
- Discrete Programming by the Filter Method
- A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
- Surrogate Constraints
- Direct Search Algorithms for Zero-One and Mixed-Integer Programming
- An Additive Algorithm for Solving Linear Programs with Zero-One Variables
- The Traveling Salesman Problem: A Survey
- Integer Programming by Implicit Enumeration and Balas’ Method
- Technical Note—Results in Using Gomory's All-Integer Integer Algorithm to Design Optimum Logic Networks
- An implicit enumeration program for zero-one integer programming
