scientific article; zbMATH DE number 3797174
alpha-beta pruningbacktrackingbin-packingbranch-and-boundcombinatorial algorithmscombinatorial optimizationcomputer sciencedecision treedecomposition algorithm for large sparse networksdescription of PERTdynamic programminggreedy algorithmheuristic algorithmsjob- schedulingknapsackmatrix multiplicationsminimum cost alphabetic treesnetwork flowsoperations researchoptimum alphabetic treeoptimum communication spanning treesresource allocationshortest pathstheory of NP- complete problems
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Discrete mathematics in relation to computer science (68R99) Algorithms in computer science (68W99) 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) Deterministic network models in operations research (90B10) Dynamic programming (90C39)
- 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
- 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
- Lower bounds for the matrix chain ordering problem (extended abstract)
- An optimal, purely functional implementation of the Garsia-Wachs algorithm
- Optimal binary search trees
- A sum of disjoint products algorithm for reliability evaluation of flow networks
- Lagrangean bounds for the optimum communication spanning tree problem
- Properties of a firm’s factor demands, optimal production correspondence, and an economy‘s aggregated supply/demand
- Automatic synthesis of parallel algorithms
- Optimum alphabetic binary trees
- Old and new results on alphabetic codes
- Applications of lattice theory to graph decomposition
- The quickest path problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4742310)
