An algorithm of internal feasible directions for linear integer programming

DOI10.1016/0377-2217(91)90081-6MaRDI QIDQ809890zbMATH OpenOpenAlexFDO

Authors N. E. Zubov

Publication date 1991

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0377-2217(91)90081-6

zbMATH Keywords

approximate algorithmpure integer linear programming

Mathematics Subject Classification ID

Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Integer programming (90C10)

Recommendations

• scientific article; zbMATH DE number 3976781
• scientific article; zbMATH DE number 3847219
• An approximate algorithm for nonlinear integer programming
• scientific article; zbMATH DE number 3972639
• scientific article; zbMATH DE number 4074810

Cites work

• 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?)
• A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems
• A simple strategy for solving a class of 0-1 integer programming models
• Combinatorial heuristic algorithms with FORTRAN
• Efficient Heuristic Procedures for Integer Linear Programming with an Interior
• 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

(15)

• Infeasible/feasible search trajectories and directional rounding in integer programming
• A new method of integer linear programming - branch direction search method
• scientific article; zbMATH DE number 3847219 (Why is no real title available?)
• A reference direction approach to multiple objective integer linear programming
• scientific article; zbMATH DE number 3972639 (Why is no real title available?)
• Algorithmes de poursuite pour la résolution de programmes (linéaires) en nombres entiers
• From approximate to exact integer programming
• scientific article; zbMATH DE number 4066620 (Why is no real title available?)
• An integer equation controlled descending path to a protean pure integer program
• An approximate algorithm for nonlinear integer programming
• An Isometric Surface Method For Integer Linear Programming * *Supported by the R&D base on advanced manufacturing technology, Academia Sinica
• Multi-objective optimization over convex disjunctive feasible sets using reference points
• scientific article; zbMATH DE number 4074810 (Why is no real title available?)
• scientific article; zbMATH DE number 3976781 (Why is no real title available?)
• An Evolutionary Solver for Pure Integer Linear 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)