An algorithm of internal feasible directions for linear integer programming
From MaRDI portal
This is an approximate algorithm for solving pure integer linear programming problems. Starting with an arbitrarily chosen integer point as initial solution the algorithm then uses feasible integer directions with one or two nonzero components. The basic characteristics of the algorithm are analyzed, and it is compared with other approximate algorithms. Numerical results of tests on a personal computer are also reported.
Recommendations
Cites work
- A simple strategy for solving a class of 0-1 integer programming models
- A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems
- Combinatorial heuristic algorithms with FORTRAN
- Efficient Heuristic Procedures for Integer Linear Programming with an Interior
- scientific article; zbMATH DE number 3427118 (Why is no real title available?)
- scientific article; zbMATH DE number 3550465 (Why is no real title available?)
- scientific article; zbMATH DE number 3550466 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- scientific article; zbMATH DE number 3249566 (Why is no real title available?)
- Interior Path Methods for Heuristic Integer Programming Procedures
- Solution of Integer Linear Programming Problems by Direct Search
- Towards a Genuinely Polynomial Algorithm for Linear Programming
Cited in
(16)- A new method of integer linear programming - branch direction search method
- A reference direction approach to multiple objective integer linear programming
- Multi-objective optimization over convex disjunctive feasible sets using reference points
- scientific article; zbMATH DE number 3847219 (Why is no real title available?)
- scientific article; zbMATH DE number 3972639 (Why is no real title available?)
- scientific article; zbMATH DE number 3976781 (Why is no real title available?)
- scientific article; zbMATH DE number 4066620 (Why is no real title available?)
- scientific article; zbMATH DE number 4074810 (Why is no real title available?)
- Algorithmes de poursuite pour la résolution de programmes (linéaires) en nombres entiers
- An Isometric Surface Method For Integer Linear Programming * *Supported by the R&D base on advanced manufacturing technology, Academia Sinica
- An Evolutionary Solver for Pure Integer Linear Programming
- An exact ceiling point algorithm for general integer linear programming
- An integer equation controlled descending path to a protean pure integer program
- An approximate algorithm for nonlinear integer programming
- From approximate to exact integer programming
- Infeasible/feasible search trajectories and directional rounding in integer programming
This page was built for publication: An algorithm of internal feasible directions for linear integer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q809890)
