scientific article; zbMATH DE number 3797174
combinatorial optimizationdynamic programmingdecision treeoperations researchnetwork flowsshortest pathsgreedy algorithmresource allocationbin-packingalpha-beta pruningbacktrackingbranch-and-boundknapsackcombinatorial algorithmsheuristic algorithmscomputer sciencematrix multiplicationsdecomposition algorithm for large sparse networksdescription of PERTjob- schedulingminimum cost alphabetic treesoptimum alphabetic treeoptimum communication spanning treestheory of NP- complete problems
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) Deterministic network models in operations research (90B10) Dynamic programming (90C39) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) 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)
- DEVELOPMENT OF A NEW THEORY WITH GENERALITY TO UNIFY DIVERSE DISCIPLINES OF KNOWLEDGE AND CAPABILITY OF APPLICATIONS
- Foreground memory management in data path synthesis
- A decomposition algorithm for multi-terminal network flows
- Automatic synthesis of parallel algorithms
- GENERALIZED FUNDAMENTAL EQUATION IN PANSYSTEMS NETWORK ANALYSIS
- Optimum alphabetic binary trees
- Old and new results on alphabetic codes
- The one-to-one shortest-path problem: An empirical analysis with the two- tree Dijkstra algorithm
- Properties of a firm’s factor demands, optimal production correspondence, and an economy‘s aggregated supply/demand
- Applications of lattice theory to graph decomposition
- I/O- and CPU-optimal recognition of strongly connected components
- A branch-and-bound algorithm to solve the equal-execution-time job scheduling problem with precedence constraint and profile
- THE DERIVATION OF UNIFORM RECURRENCE EQUATIONS FOR THE KNAPSACK PROBLEM
- A polynomial-time algorithm for message routing in hierarchical communication networks
- Efficient inference in Bayes networks as a combinatorial optimization problem
- Characterizing the flow equivalent trees of a network
- An optimal, purely functional implementation of the Garsia-Wachs algorithm
- HIGH-PERFORMANCE COMPUTING FOR ROBOT DYNAMIC PARAMETERS LEARNING
- Optimal binary search trees
- The quickest path problem
- A sum of disjoint products algorithm for reliability evaluation of flow networks
- Lower bounds for the matrix chain ordering problem (extended abstract)
- Ancestor tree for arbitrary multi-terminal cut functions
- Testing the optimality of alphabetic trees
- The single most vital arc in the most economical path problem -- a parametric analysis
- Richard Bellman's contributions to computer science
- An approach to production planning and scheduling in cyclically scheduled manufacturing systems
- Dynamic programming and graph optimization problems
- An algorithm for determining an opaque minimal forest of a convex polygon
- Lagrangean bounds for the optimum communication spanning tree problem
- A label-setting algorithm for finding a quickest path
- Minimizing the total cost in an integrated vendor-managed inventory system
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)
