An algorithm of internal feasible directions for linear integer programming
From MaRDI portal
Publication:809890
DOI10.1016/0377-2217(91)90081-6zbMATH Open0732.90065OpenAlexW2086440213MaRDI QIDQ809890FDOQ809890
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
Recommendations
Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Integer programming (90C10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems
- Interior Path Methods for Heuristic Integer Programming Procedures
- Efficient Heuristic Procedures for Integer Linear Programming with an Interior
- Towards a Genuinely Polynomial Algorithm for Linear Programming
- Title not available (Why is that?)
- Solution of Integer Linear Programming Problems by Direct Search
- A simple strategy for solving a class of 0-1 integer programming models
- Combinatorial heuristic algorithms with FORTRAN
Cited In (15)
- 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
- Title not available (Why is that?)
- An integer equation controlled descending path to a protean pure integer program
- From approximate to exact integer programming
- An Evolutionary Solver for Pure Integer Linear Programming
- Infeasible/feasible search trajectories and directional rounding in integer programming
- Algorithmes de poursuite pour la résolution de programmes (linéaires) en nombres entiers
- Title not available (Why is that?)
- An approximate algorithm for nonlinear integer programming
- A reference direction approach to multiple objective integer linear programming
- A new method of integer linear programming - branch direction search method
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
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)
