Publication:4742310
zbMath0505.68022MaRDI QIDQ4742310
No author found.
Publication date: 1982
dynamic programming; combinatorial optimization; branch-and-bound; greedy algorithm; resource allocation; shortest paths; heuristic algorithms; network flows; decision tree; computer science; knapsack; combinatorial algorithms; operations research; backtracking; bin-packing; alpha-beta pruning; matrix multiplications; decomposition algorithm for large sparse networks; description of PERT; job- scheduling; minimum cost alphabetic trees; optimum alphabetic tree; optimum communication spanning trees; theory of NP- complete problems
68Q25: Analysis of algorithms and problem complexity
68-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science
68R10: Graph theory (including graph drawing) in computer science
90B10: Deterministic network models in operations research
90C39: Dynamic programming
90-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming
90-02: Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming
68-02: Research exposition (monographs, survey articles) pertaining to computer science
68R99: Discrete mathematics in relation to computer science
68W99: Algorithms in computer science
Related Items