An algorithm of internal feasible directions for linear integer programming

DOI10.1016/0377-2217(91)90081-6zbMath0732.90065OpenAlexW2086440213MaRDI QIDQ809890

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

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

Related Items (3)

A reference direction approach to multiple objective integer linear programming ⋮ An approximate algorithm for nonlinear integer programming ⋮ Multi-objective optimization over convex disjunctive feasible sets using reference points

Cites Work

• A simple strategy for solving a class of 0-1 integer programming models
• Combinatorial heuristic algorithms with FORTRAN
• Towards a Genuinely Polynomial Algorithm for Linear Programming
• Interior Path Methods for Heuristic Integer Programming Procedures
• A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems
• Solution of Integer Linear Programming Problems by Direct Search
• Efficient Heuristic Procedures for Integer Linear Programming with an Interior
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An algorithm of internal feasible directions for linear integer programming