Back to Search
Start Over
An implicit enumeration algorithm for the all integer programming problem
- Source :
- Computers & Mathematics with Applications. 4:15-31
- Publication Year :
- 1978
- Publisher :
- Elsevier BV, 1978.
-
Abstract
- In this paper an implicit enumeration algorithm is presented for solving the general integer programming problem. The algorithm is a generalization of algorithms of Balas and Geoffrion for solving 0-1 problems. In order that each variable may be treated directly, a special data structure has been designed. Based on this data structure, a procedure is developed which efficiently keeps track of the status of the algorithm and of the potential actions to be taken at any stage in the procedure. The concept of a ‘best’ surrogate constraint is extended and incorporated into the algorithm. The algorithm can be modified for solving mixed integer programming problems.
- Subjects :
- Mathematical optimization
Generalization
Branch and price
Integer relation algorithm
Pohlig–Hellman algorithm
Data structure
Computational Mathematics
Computational Theory and Mathematics
Modelling and Simulation
Modeling and Simulation
Algorithm design
Branch and cut
Integer programming
Mathematics
Subjects
Details
- ISSN :
- 08981221
- Volume :
- 4
- Database :
- OpenAIRE
- Journal :
- Computers & Mathematics with Applications
- Accession number :
- edsair.doi.dedup.....95e74dca0232d1b59f391103a4ffe1b9