An Approach to Solving Linear Discrete Optimization Problems

DOI10.1145/321574.321584zbMath0195.20703OpenAlexW2053413343MaRDI QIDQ5591241

Richard H. Roth

Publication date: 1970

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/321574.321584

zbMATH Keywords

operations research

Related Items

Randomized algorithms in combinatorial optimization: A survey, An effective structured approach to finding optimal partitions of networks, The multidimensional 0-1 knapsack problem: an overview., Single machine scheduling to minimize mean absolute lateness: A heuristic solution, Large-scale mixed integer programming: Benders-type heuristics, Heuristics and reduction methods for multiple constraints 0-1 linear programming problems