scientific article
From MaRDI portal
Publication:3809582
zbMath0659.90062MaRDI QIDQ3809582
Publication date: 1988
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
asymptotic behaviorcombinatorial optimizationsimulated annealingiterative improvementMarkovian transition law
Numerical mathematical programming methods (65K05) Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (32)
Optimal bin location and sequencing in printed circuit board assembly ⋮ Multiple-type, two-dimensional bin packing problems: Applications and algorithms ⋮ Global estimation of feedforward networks with a priori constraints ⋮ Estimation of a normal mixture model through Gibbs sampling and prior feedback ⋮ Two new algorithms for the min-power broadcast problem in static ad hoc networks ⋮ Graph domination, tabu search and the football pool problem ⋮ A study on local search neighborhoods for the job shop scheduling problem with total weighted tardiness objective ⋮ Efficient heuristics for robot acquisition planning for a CIM system ⋮ Unnamed Item ⋮ The construction of antipodal triple systems by simulated annealing ⋮ Simulated annealing: A tool for operational research ⋮ A stone resource assignment model under the fuzzy environment ⋮ Trends in systolic and cellular computation ⋮ A note on the effect of neighborhood structure in simulated annealing ⋮ Aggregating disparate estimates of chance ⋮ Simulated annealing simulated ⋮ EDUCING INCONSISTENCY IN FUZZY AHP BY MATHEMATICAL PROGRAMMING MODELS ⋮ Simulated annealing: An introduction ⋮ Heuristic pattern search and its hybridization with simulated annealing for nonlinear global optimization ⋮ DLSP for two-stage multi-item batch production ⋮ \(K\)-means cloning: adaptive spherical \(K\)-means clustering ⋮ A METHOD BASED ON THE DYNAMIC WEIGHTED GEOMETRIC AGGREGATION OPERATOR FOR DYNAMIC HYBRID MULTI-ATTRIBUTE GROUP DECISION MAKING ⋮ Some new results on simulated annealing applied to the job shop scheduling problem ⋮ Multi-level lot-sizing problem: Evaluation of a simulated-annealing heuristic ⋮ Heuristics for minimizing total weighted tardiness in flexible flow shops ⋮ The discrete lot-sizing and scheduling problem: Complexity and modification for batch availability ⋮ The optimal packing of arbitrarily-shaped polygons using simulated annealing and polynomial-time cooling schedules ⋮ A Bayesian Approach to Simulated Annealing ⋮ A large step random walk for minimizing total weighted tardiness in a job shop ⋮ Sensitivity analysis for indirect measurement in scatterometry and the reconstruction of periodic grating structures ⋮ Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing ⋮ Heuristic solutions to multi-depot location-routing problems
This page was built for publication:
