Heuristics and reduction methods for multiple constraints 0–1 linear programming problems
- 28 February 1986
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 24 (2) , 206-215
- https://doi.org/10.1016/0377-2217(86)90042-1
Abstract
No abstract availableThis publication has 19 references indexed in Scilit:
- An algorithm for the solution of the 0–1 knapsack problemComputing, 1982
- Calculating surrogate constraintsMathematical Programming, 1980
- Pivot and Complement–A Heuristic for 0-1 ProgrammingManagement Science, 1980
- New Greedy-Like Heuristics for the Multidimensional 0-1 Knapsack ProblemOperations Research, 1979
- HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTSDecision Sciences, 1977
- On improving relaxation methods by modified gradient techniquesPublished by Springer Nature ,1975
- A HEURISTIC FOR GENERAL INTEGER PROGRAMMING*Decision Sciences, 1974
- The traveling-salesman problem and minimum spanning trees: Part IIMathematical Programming, 1971
- Efficient Heuristic Procedures for Integer Linear Programming with an InteriorOperations Research, 1969
- A Multiphase-Dual Algorithm for the Zero-One Integer Programming ProblemOperations Research, 1965