An Approach to Solving Linear Discrete Optimization Problems

DOI10.1145/321574.321584MaRDI QIDQ5591241zbMATH OpenOpenAlexFDO

Authors 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

Cited in

(6)

• Heuristics and reduction methods for multiple constraints 0-1 linear programming problems
• 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

This page was built for publication: An Approach to Solving Linear Discrete Optimization Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5591241)