Publication:4742310

zbMath0505.68022MaRDI QIDQ4742310

No author found.

Publication date: 1982

zbMATH Keywords

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

Mathematics Subject Classification ID

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

HIGH-PERFORMANCE COMPUTING FOR ROBOT DYNAMIC PARAMETERS LEARNING, An approach to production planning and scheduling in cyclically scheduled manufacturing systems, THE DERIVATION OF UNIFORM RECURRENCE EQUATIONS FOR THE KNAPSACK PROBLEM, DEVELOPMENT OF A NEW THEORY WITH GENERALITY TO UNIFY DIVERSE DISCIPLINES OF KNOWLEDGE AND CAPABILITY OF APPLICATIONS, A sum of disjoint products algorithm for reliability evaluation of flow networks, Optimal binary search trees, Applications of lattice theory to graph decomposition, The quickest path problem, Richard Bellman's contributions to computer science, A decomposition algorithm for multi-terminal network flows, An algorithm for determining an opaque minimal forest of a convex polygon, A branch-and-bound algorithm to solve the equal-execution-time job scheduling problem with precedence constraint and profile, A polynomial-time algorithm for message routing in hierarchical communication networks, Ancestor tree for arbitrary multi-terminal cut functions, Testing the optimality of alphabetic trees, I/O- and CPU-optimal recognition of strongly connected components, The one-to-one shortest-path problem: An empirical analysis with the two- tree Dijkstra algorithm, The single most vital arc in the most economical path problem -- a parametric analysis, Dynamic programming and graph optimization problems, Efficient inference in Bayes networks as a combinatorial optimization problem, Characterizing the flow equivalent trees of a network, A label-setting algorithm for finding a quickest path, Minimizing the total cost in an integrated vendor-managed inventory system, GENERALIZED FUNDAMENTAL EQUATION IN PANSYSTEMS NETWORK ANALYSIS, Foreground memory management in data path synthesis