scientific article

Publication date: 1978

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

dynamic programming divide-and-conquer algorithm design algorithmic paradigms greedy method search methods in graphs

Analysis of algorithms and problem complexity (68Q25) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) General topics in the theory of software (68N01) Algorithms in computer science (68W99)

Related Items

Mode-finding algorithms revisited, A hybrid algorithm for solving convex separable network flow problems, Sparktope: linear programs from algorithms, On reconfigurability of VLSI linear arrays, Random-tree Diameter and the Diameter-constrained MST, LOAD BALANCING, SELECTION AND SORTING ON THE STAR AND PANCAKE INTERCONNECTION NETWORKS∗, AN EFFICIENT ALGORITHM FOR MANAGING A PARALLEL HEAP∗, SORTING AND SELECTION ON DISTRIBUTED MEMORY BUS COMPUTERS, Lower bounds for the matrix chain ordering problem, Rescheduling to minimize makespan on a changing number of identical processors, Network upgrading problems, Domino treewidth, Reservation table scheduling: branch-and-bound based optimizationvs. integer linear programming techniques, Efficient points on a network, The node-weighted steiner tree problem, On the balanced divide and conquer equation, Parallel algorithms for a depth first search and a breadth first search, Finding a manhattan path and related problems, A linear time algorithm to check for the existence of a rectangular dual of a planar triangulated graph, Analysis of a flow problem with fixed charges, Unnamed Item, Sorting using heap structure, Unnamed Item, Increasing robustness in global adaptive quadrature through interval selection heuristics, The travelling salesman problem: selected algorithms and heuristics†, Optimization issues in predictive control with fuzzy objective functions, Using branch-and-bound algorithms to obtain suboptimal solutions, Matching and spanning in certain planar graphs, A linear time approximation algorithm for multiprocessor scheduling, Encapsulating non-determinacy in an abstract data type with determinate semantics, GENERATING FUZZY RULES FROM TRAINING DATA CONTAINING NOISE FOR HANDLING CLASSIFICATION PROBLEMS, Some sequential graph colouring algorithms, Sorting multisets stably in minimum space, Combination of mobile agent and evolutionary algorithm to optimize the client transport services, NP-Complete operations research problems and approximation algorithms, On Interference Graphs, A model search procedure for hierarchical models, A correctness proof of an indenting program, Comments over some non-chromatic rings, An ideal column algorithm for integer programs with special ordered sets of variables, A Comprehensive Model of Dynamic Programming, Sorting and Merging in Rounds, The searching over separators strategy to solve some NP-hard problems in subexponential time, Generalized minimum spanning tree games, The principle of optimality in the design of efficient algorithms, Sorting multisets stably in minimum space, Asymptotic optimal HEAPSORT algorithm, A dynamic programming approach to the complete set partitioning problem, Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm, The hierarchical structure of graph searches, Fuzzy weighted average: A max-min paired elimination method, Optimal computation of prefix sums on a binary tree of processors, On the complexity of induction of structural descriptions, A parallel approach for theorem proving in propositional logic, The general problem solving algorithm and its implementation, On a scheduling problem where a job can be executed only by a limited number of processors, A note on anomalies in parallel branch-and-bound algorithms with one-to- one bounding functions, Heuristic search for Hamilton cycles in cubic graphs, Design of computer network topologies: a Vroom inspired psychoclonal algorithm, Optimality tests for fixed points of the fuzzy c-means algorithm, Parallel depth first search. I: Implementation, Solutions of two minmax recurrences in parallel processing with variable recombination overhead, Job selection in a heavily loaded shop, A randomized parallel branch-and-bound algorithm, A new algorithm for the integer knapsack problem and its parallelization, Weakly adaptive comparison searching, Testing and reconfiguration of VLSI linear arrays, Pruning with improving sequences in lazy functional programs, Dynamic programming based algorithms for the discounted \(\{0-1\}\) knapsack problem, On the Ferrers dimension of a digraph, P-optimal heuristics, The weighted perfect domination problem, Effective algorithm and heuristic for the generalized assignment problem., Parallel algorithms for the single source shortest path problem, Greedy binary search trees are nearly optimal, Computational performance of basic state reduction based dynamic programming algorithms for bi-objective 0-1 knapsack problems, On the cost of evaluating polynomials and their derivatives, The bit-operation complexity of approximate evaluation of matrix and polynomial products using modular arithmetic, Information retrieval based on fuzzy associations, Optimal capacity and operation of deteriorating chemical production service facilities, Near optimal multiple choice index selection for relational databases, A two state reduction based dynamic programming algorithm for the bi-objective \(0\)-\(1\) knapsack problem, Branch-and-bound as a higher-order function, Fault-tolerant parallel \(k\) selection algorithm in \(n\)-cube networks, A methodology for detecting shared variable dependencies in logic programs, Optimal heapsort algorithm, Scheduling to minimize weighted earliness and tardiness about a common due-date, Shortest consistent superstrings computable in polynomial time, Multi-family scheduling in a two-machine reentrant flow shop with setups, The geo-graph in practice: creating United States congressional districts from census blocks, Hybrid evolutionary algorithm for the b-chromatic number, Online ascending auctions for gradually expiring items, The slab dividing approach to solve the Euclidean \(P\)-center problem, Topological arrangements of \(M/G/c/K\), \(M/G/c/c\) queues in transportation and material handling systems, Congestion control for a system with parallel stations and homogeneous customers using priority passes, The most vital edges in the minimum spanning tree problem, Systolic partitioning algorithms, Optimization problems in multivariable fuzzy predictive control, A linear time algorithm for embedding hypercube into cylinder and torus, A cost-reducing question-selection algorithm for propositional knowledge-based systems, Efficient multigrid algorithms for locally constrained parallel systems, An efficient algorithm for processing multi-relation queries in relational databases, Benders decomposition: solving binary master problems by enumeration, Efficient geo-graph contiguity and hole algorithms for geographic zoning and dynamic plane graph partitioning, Stochastic on-line knapsack problems, Optimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors, On the quickest path problem, Solving to optimality the uncapacitated fixed-charge network flow problem, Strategies for distributed query optimization, Manufacturing cell formation by state-space search, Optimal speeding up of parallel algorithms based upon the divide-and- conquer strategy, A branch and bound algorithm for solving the multiple-choice knapsack problem, Exponential bounds for the running time of a selection algorithm, Polynomial size linear programs for problems in \textsc{P}, Optimal matching of deformed patterns with positional influence, Least-cost partition algorithms, An LC branch-and-bound algorithm for the module assignment problem, Efficient computing methods for parallel processing: An implementation of the Viterbi algorithm, Unbounded knapsack problem: Dynamic programming revisited, A parallel branch-and-bound algorithm to compute a tighter tardiness bound for preemptive global EDF, Estimating the Held-Karp lower bound for the geometric TSP, Loop-free algorithms for traversing binary trees, A general program scheme for finding bridges, A simplified NP-complete satisfiability problem, Linear time algorithms on mirror trees, General branch and bound, and its relation to \(A^*\) and \(AO^*\), Admissible heuristic search in AND/OR graphs, An O(n log n) Manhattan path algorithm, A backtracking method for constructing perfect hash functions from a set of mapping functions, Clustering to minimize the maximum intercluster distance, An adaptive and cost-optimal parallel algorithm for minimum spanning trees, Job selection and sequencing on a single machine in a random environment, An analytical comparison of two string searching algorithms, Minimum-weight vertex cover problem for two-class resource connection graphs, Distributed task assignment using critical path estimate, A linear-time algorithm for a special case of disjoint set union, Fuzzy weighted average: An improved algorithm, Optimality in musical melodies and harmonic progressions: The travelling musician, Constant-time Hough transform on the processor arrays with reconfigurable bus systems, Representing inverses in pure network flow optimization, An optimal scheduling algorithm for preemptable real-time tasks, A systolic algorithm for dynamic programming