scientific article; zbMATH DE number 3797174

zbMath0505.68022MaRDI QIDQ4742310

No author found.

Publication date: 1982

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

dynamic programmingcombinatorial optimizationbranch-and-boundgreedy algorithmresource allocationshortest pathsheuristic algorithmsnetwork flowsdecision treecomputer scienceknapsackcombinatorial algorithmsoperations researchbacktrackingbin-packingalpha-beta pruningmatrix multiplicationsdecomposition algorithm for large sparse networksdescription of PERTjob- schedulingminimum cost alphabetic treesoptimum alphabetic treeoptimum communication spanning treestheory of NP- complete problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Dynamic programming (90C39) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Discrete mathematics in relation to computer science (68R99) Algorithms in computer science (68W99)

Related Items (29)

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

This page was built for publication: