scientific article
From MaRDI portal
zbMath0674.90059MaRDI QIDQ3994799
Jan H. M. Korst, Emile H. L. Aarts
Publication date: 17 September 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Searching and sorting (68P10) Learning and adaptive systems in artificial intelligence (68T05) Combinatorial optimization (90C27) Pattern recognition, speech recognition (68T10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Theory of operating systems (68N25)
Related Items
Global optimization with exploration/selection algorithms and simulated annealing, Heuristic optimization of experimental designs., A simulated annealing approach for the circular cutting problem, Exploring interactions in high-dimensional genomic data: an overview of logic regression, with applications, Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem, Comparison of metaheuristic algorithms for examination timetabling problem, A unifying approach to heuristic search, New algorithms for 3D surface description from binocular stereo using integration, An analog Hopfield network to overcome excessive smoothing in shape from shading, Boltzmann machines as a model for parallel annealing, Packing 16, 17 or 18 circles in an equilateral triangle, Binary interaction methods for high dimensional global optimization and machine learning, Comparative Analysis of Some Metaheuristics for Discrete-Continuous Project Scheduling with Activities of Identical Processing Rates, Minimizing deviation from scheduled times in a single mixed-operation runway, Curve approximation by adaptive neighborhood simulated annealing and piecewise Bézier curves, Constructing efficient simulated annealing algorithms, Strategies with memories: Local search in an application oriented environment. Applied local search -- a prologue, Local search with memory: Benchmarking RTS, Efficient heuristics for robot acquisition planning for a CIM system, A variable-depth search algorithm for the recursive bipartitioning of signal flow graphs, Modeling and solving a real-life multi-skill shift design problem, Bilevel programming in traffic planning: Models, methods and challenge, Stochastic simulations of two-dimensional composite packings, Recognition-by-parts: A computational approach to human learning and generalization of shapes, An analysis of parallel heuristics for task allocation in multicomputers, Metaheuristics: A bibliography, Parallel local search, Cybernetic optimization by simulated annealing: Accelerating convergence by parallel processing and probabilistic feedback control, The construction of antipodal triple systems by simulated annealing, Exact and heuristic procedures for solving the fuzzy portfolio selection problem, Some thoughts on combinatorial optimisation, The design of a 0-1 integer optimizer and its application in the Carmen system, FPGA implementation of a stochastic neural network for monotonic pseudo-Boolean optimization, Spontaneous scale-free structure of spike flow graphs in recurrent neural networks, A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version., An Introduction to Geometric Semantic Genetic Programming, Computing elastic moduli of two-dimensional random networks of rigid and nonrigid bonds by simulated annealing, A robust simulated annealing based examination timetabling system., A local search template., Placement by thermodynamic simulated annealing, Scheduling sports competitions at multiple venues -- revisited, Mixing time and simulated annealing for the stochastic cellular automata, A study of search algorithms' optimization speed, On the classification of NP-complete problems in terms of their correlation coefficient, Covering a rectangle with six and seven circles, Critical phenomena in a collective computation algorithm for combinatorial optimization problems, Combining interval branch and bound and stochastic search, The method of global equilibrium search, Stochastic comparison algorithm for discrete optimization with estimation of time-varying objective functions, Fuzzy programming for multiobjective job shop scheduling with fuzzy processing time and fuzzy duedate through genetic algorithms, Unsupervised and supervised data classification via nonsmooth and global optimization (with comments and rejoinder), On constrained simulation and optimization by Metropolis chains, A two-phased approach to the supply network reconfiguration problem, Constraint partitioning in penalty formulations for solving temporal planning problems, A formal analysis of why heuristic functions work, Robust surgery loading, Multicanonical jump walk annealing assisted by tabu for dynamic optimization of chemical engineering processes, A simulated annealing algorithm for transient optimization in gas networks, An intelligent agent negotiation strategy in the electronic marketplace environment, Approximate vs. exact algorithms to solve the maximum line length problem, Improving inductive logic programming by using simulated annealing, An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem, Geographic and network surveillance via scan statistics for critical area detection, A tutorial on the cross-entropy method, A stochastic minimum cross-entropy method for combinatorial optimization and rare-event estimation, The antennas preassignment problem, Simulated annealing and tabu search for multi-mode resource-constrained project scheduling with positive discounted cash flows and different payment models, A study of ACO capabilities for solving the maximum clique problem, Speed-up simulated annealing by parallel coordinates, Hybrid heuristics for examination timetabling problem, A heuristic approach for the generation of multivariate random samples with specified marginal distributions and correlation matrix, The weight-decay technique in learning from data: an optimization point of view, Optimal timeslot and channel allocation considering fairness for multicell CDMA/TDD systems, Solution quality of random search methods for discrete stochastic optimization, A simulated annealing and hill-climbing algorithm for the traveling tournament problem, Heuristic unidirectional flowpath design approaches for automated guided vehicle systems, Metaheuristic search techniques for multi-objective and stochastic problems: a history of the inventions of Walter J. Gutjahr in the past 22 years, On the convergence of parallel simulated annealing, Two simulated annealing-based heuristics for the job shop scheduling problem, Manpower allocation using genetic annealing, Evolutionary games with two timescales, Guided local search and its application to the traveling salesman problem, Solving the medium newspaper production/distribution problem, Neighborhood Parallel Simulated Annealing, Interactive multiple objective programming using Tchebycheff programs and artificial neural networks, Reliable wireless multimedia sensor network design: comparison of hybrid metaheuristics and a matheuristic, Spatial sampling design and covariance-robust minimax prediction based on convex design ideas, A neural network for the minimum set covering problem, Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees, Stochastic comparison algorithm for continuous optimization with estimation, Fast high precision decision rules for valuing manufacturing flexibility, State-of-the-art exact and heuristic solution procedures for simple assembly line balancing, A fuzzy satisficing method for electric power plant coal purchase using genetic algorithms, An asymptotical study of combinatorial optimization problems by means of statistical mechanics, Evolution and state-of-the-art in integer programming, A class of convergent generalized hill climbing algorithms, A simulation-based approach to stochastic dynamic programming, Optimal batting orders in one-day cricket, ACO algorithms with guaranteed convergence to the optimal solution, Simulated annealing for discrete optimization with estimation, Dynamic sizing of multilayer perceptrons, An experimental comparison of three heuristics for the WVCP, Parallel physical optimization algorithms for allocating data to multicomputer nodes, New upper bounds for the football pool problem for 11 and 12 matches, A review of combinatorial problems arising in feedforward neural network design, Simulated annealing for constrained global optimization, Large-scale layout of facilities using a heuristic hybrid algorithm, Simulated annealing and tabu search approaches to unidirectional flowpath design for automated guided vehicle systems, Multiple-type, two-dimensional bin packing problems: Applications and algorithms, Combinatorial optimization techniques for spacecraft scheduling automation, A survey of search methodologies and automated system development for examination timetabling, A comparative runtime analysis of heuristic algorithms for satisfiability problems, Simulated annealing and tabu search: Lessons from a line search, Evolution based learning in a job shop scheduling environment, Construction of Bayesian network structures from data: A brief survey and an efficient algorithm, The MIN PFS problem and piecewise linear model estimation, Solving optimization problems with variable-constraint by an extended Cohen-Grossberg model, A hypergraph model for constraint logic programming and applications to bus drivers' scheduling, A simulated annealing algorithm for maximum likelihood pedigree reconstruction, Boolean query optimization and the 0-1 hyperbolic sum problem, A comparative study of some pseudorandom number generators, Nested simulated annealing approach to periodic routing problem of a retail distribution system, A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem, A molecular structure matching problem, Asymptotic convergence of a simulated annealing algorithm for multiobjective optimization problems, Fast local search and guided local search and their application to British Telecom's workforce scheduling problem, The cross-entropy method for continuous multi-extremal optimization, Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem, Guillotineable bin packing: A genetic approach, A random sampling approach to worst-case design of structures, A natural model and a parallel algorithm for approximately solving the maximum weighted independent set problem, Modified simulated annealing algorithms for the flow shop sequencing problem, Space and time allocation in a shipyard assembly hall, Rigid pricing and rationally inattentive consumer, A generalized Borgonovo's importance measure for fuzzy input uncertainty, Simulated annealing: A tool for operational research, Decentralized trade, random utility and the evolution of social welfare, A tabu-search heuristic for deterministic two-mode blockmodeling of binary network matrices, The generalized balanced academic curriculum problem with heterogeneous classes, Semi-iterative minimum cross-entropy algorithms for rare-events, counting, combinatorial and integer programming, Global optimization and simulated annealing, Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis, Finding the differential characteristics of block ciphers with neural networks, Optimization of energy confinement in the \(1/\nu \) regime for stellarators, Trends in systolic and cellular computation, Identification of multivariate AR-models by threshold accepting, On the performance guarantee of neural networks for NP-hard optimization problems, Simulated annealing with asymptotic convergence for nonlinear constrained optimization, Convergence properties of high-order Boltzmann machines, Golden ratio versus pi as random sequence sources for Monte Carlo integration, Neural networks for control systems - a survey, Simulated annealing for machine layout problems in the presence of zoning constraints, Optimal design of LAN-WAN internetworks: An approach using simulated annealing, A simulated annealing strategy for the detection of arbitrarily shaped spatial clusters, Performance of a neural network method with set partitioning, Stochastic techniques for global optimization: A survey of recent advances, Neural network methods in combinatorial optimization, Scheduling with neural networks -- the case of the Hubble Space Telescope, A connectionist approach to the quadratic assignment problem, Comparison of the performance of modern heuristics for combinatorial optimization on real data, Solving combinatorial optimization problems using augmented Lagrange chaotic simulated annealing, Global optimization methods for multimodal inverse problems, Generalized surrogate problem methodology for online stochastic discrete optimization, Learning algorithm for multimodal optimization, Solving the uncapacitated hub location problem using genetic algorithms, Optimization and analysis of the profitability of tariff structures with two-part tariffs, Learning with generalization capability by kernel methods of bounded complexity, Theoretical aspects of multicriteria flight gate scheduling: Deterministic and fuzzy models, Decentralized multi-level uncapacitated lot-sizing by automated negotiation, Bayesian unsupervised classification framework based on stochastic partitions of data and a parallel search strategy, Algorithmic inference: From information granules to subtending functions, An adaptive, multiple restarts neural network algorithm for graph coloring, Massively parallel analog tabu search using neural networks applied to simple plant location problems, The job shop scheduling problem: Conventional and new solution techniques, Parallel processing for difficult combinatorial optimization problems, Neural networks as systems for recognizing patterns, A survey on metaheuristics for stochastic combinatorial optimization, Simulated annealing with time-dependent energy function via Sobolev inequalities, The single-finger keyboard layout problem, A feedback algorithm for determining search parameters for Monte Carlo optimization, The life span method -- a new variant of local search, Scheduling projects to maximize net present value -- the case of time-dependent, contingent cash flows, Two aspects of optimal diet determination for pig production: Efficiency of solution and incorporation of cost variation, Optimal allocation of simulation experiments in discrete stochastic optimization and approximative algorithms, Some results on the spatial breakdown point of robust point estimates of the variogram, Exemplar-based clustering via simulated annealing, Hesitant adaptive search for global optimisation, Some personal views on the current state and the future of locational analysis, Nonlinear integer programming by Darwin and Boltzmann mixed strategy, Efficiently solving the traveling thief problem using hill climbing and simulated annealing, Discrete-continuous scheduling to minimize the makespan for power processing rates of jobs, Improved exploration in Hopfield network state-space through parameter perturbation driven by simulated annealing, Variable neighborhood search heuristics for selecting a subset of variables in principal component analysis, Application of the simulated annealing algorithm to the combinatorial optimization problem with permutation property: An investigation of generation mechanism, Algorithms for a multi-level network optimization problem, Some experiments with simulated annealing techniques for packing problems, Simulated annealing for resource-constrained scheduling, Isotropic effective energy simulated annealing searches for low energy molecular cluster states, Genetic local search in combinatorial optimization, A parallel build-up algorithm for global energy minimizations of molecular clusters using effective energy simulated annealing, Heuristic unidirectional flowpath design approaches for automated guided vehicle systems, Introduction to Yuragi Theory and Yuragi Control, Decision tree design by simulated annealing, Improved bounds for the large-time behaviour of simulated annealing, A STUDY OF MASSIVELY PARALLEL SIMULATED ANNEALING ALGORITHMS FOR CHROMOSOME RECONSTRUCTION VIA CLONE ORDERING, Zero-Inertia Limit: From Particle Swarm Optimization to Consensus-Based Optimization, An Improved Simulated Annealing Algorithm with Genetic Characteristics and the Traveling Salesman Problem, Neural networks and complexity theory, Multi‐objective optimization of transporting blood products by routing UAVs: the case of Istanbul, Shop scheduling in manufacturing environments: a review, Boolean matrix factorization based on collaborative neurodynamic optimization with Boltzmann machines, On the mean‐field limit for the consensus‐based optimization, Mathematical aspects of the Digital Annealer's simulated annealing algorithm, On the global convergence of particle swarm optimization methods, Unnamed Item, Reconstruction of pedigrees in clonal plant populations, Heuristics from Nature for Hard Combinatorial Optimization Problems, On the computational power of discrete Hopfield nets, Simulated annealing algorithm for solving the single machine early/tardy problem, A simulated annealing algorithm for system cost minimization subject to reliability constraints, Reconstruction of pedigrees in clonal plant populations, Unnamed Item, Vehicle Routing Problems with Inter-Tour Resource Constraints, A hybrid neural optimization scheme based on parallel updates, From particle swarm optimization to consensus based optimization: Stochastic modeling and mean-field limit, Comparing descent heuristics and metaheuristics for the vehicle routing problem, Online surrogate problem methodology for stochastic discrete resource allocation problem., Simulated annealing and its application to cobb-douglas economic model, The Secret Life of Keys: On the Calculation of Mechanical Lock Systems, Analysis and guidelines to obtain a good uniform fuzzy partition granularity for fuzzy rule-based systems using simulated annealing, Least third-order cumulant method with adaptive regularization parameter selection for neural networks, RE-FORMATION OF MOBILE AGENTS STRUCTURE BY THE SYNCHRONIZATION OF COUPLED CHAOTIC OSCILLATORS, A homotopy approach to improving PEM identification of ARMAX models, Optimizing marine cargo in the Aegean with the simulated annealing algorithm, Approximate algorithms for generalized maximum utility problems, Fast parallel heuristics for the job shop scheduling problem, Stochastic approximation algorithms: overview and recent trends., Algorithms for real time magnetic field tracing and optimization, Simulation-based optimization using simulated annealing with ranking and selection, Convergence rate of a simulated annealing algorithm with noisy observations, A Distributed Immune Algorithm for Solving Optimization Problems, A NEW FUZZY-DATA MINING METHOD FOR PATTERN CLASSIFICATION BY PRINCIPAL COMPONENT ANALYSIS, Fast annealing genetic algorithm for multi-objective optimization problems, Mathematical foundation of quantum annealing, Value and Policy Function Approximations in Infinite-Horizon Optimization Problems, COMPARISON OF SCHEDULING EFFICIENCY IN TWO/THREE-MACHINE NO-WAIT FLOW SHOP PROBLEM USING SIMULATED ANNEALING AND GENETIC ALGORITHM, Optimal lineups in Twenty20 cricket, Consensus-based optimization on hypersurfaces: Well-posedness and mean-field limit, Mixed Tabu machine for portfolio optimization problem, Unnamed Item, Comparative analysis of the cutting angle and simulated annealing methods in global optimization, Some Key Techniques in Electromagnetic and Thermal Field Modeling, Optimization of Fresh Food Distribution Route Using Genetic Algorithm with the Best Selection Technique, A hybrid algorithm for TSP, Skew brownian motion and complexity of the alps algorithm
