An implicit enumeration algorithm for the all integer programming problem

DOI10.1016/0898-1221(78)90004-4zbMATH Open0373.90051OpenAlexW1991822707MaRDI QIDQ1245147FDOQ1245147

Authors: Anil B. Jambekar, David Steinberg 

Publication date: 1978

Published in: Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(78)90004-4

Mathematics Subject Classification ID

Integer programming (90C10)

Cites Work

• An Automatic Method of Solving Discrete Programming Problems
• An Improved Implicit Enumeration Approach for Integer Programming
• An Additive Algorithm for Solving Linear Programs with Zero-One Variables
• Discrete Programming by the Filter Method
• Integer Programming by Implicit Enumeration and Balas’ Method
• Direct Search Algorithms for Zero-One and Mixed-Integer Programming
• Solution of Integer Linear Programming Problems by Direct Search
• Letter to the Editor—Computational Results of an Integer Programming Algorithm

Cited In (1)

• Computational experience with an algorithm for 0-1 integer programming

This page was built for publication: An implicit enumeration algorithm for the all integer programming problem

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