Publication:5472387
From MaRDI portal
zbMath1126.68032MaRDI QIDQ5472387
Holger H. Hoos, Thomas Stützle
Publication date: 12 June 2006
Full work available at URL: http://www.sciencedirect.com/science/book/9781558608726
68P10: Searching and sorting
68-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Related Items
Iterative Flattening Search on RCPSP/max Problems: Recent Developments, A framework for analyzing sub-optimal performance of local search algorithms, The multi-story space assignment problem, Heuristic and exact algorithms for a min-max selective vehicle routing problem, A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems, Local search and lower bounds for the patient admission scheduling problem, Local search with edge weighting and configuration checking heuristics for minimum vertex cover, Algorithms for a realistic variant of flowshop scheduling, Classification of applied methods of combinatorial optimization, Statistical regimes across constrainedness regions, Clause weighting local search for SAT, A review of metrics on permutations for search landscape analysis, Boosting haplotype inference with local search, Estimation-based metaheuristics for the probabilistic traveling salesman problem, Variable selection and updating in model-based discriminant analysis for high dimensional data with food authenticity applications, Design and analysis of stochastic local search for the multiobjective traveling salesman problem, Hybrid metaheuristics with evolutionary algorithms specializing in intensification and diversification: overview and progress report, Hybridization of very large neighborhood search for ready-mixed concrete delivery problems, Adaptive sample size and importance sampling in estimation-based local search for the probabilistic traveling salesman problem, General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic, The quadratic three-dimensional assignment problem: exact and approximate solution methods, Satisfiability testing of Boolean combinations of pseudo-Boolean constraints using local-search techniques, Understanding the role of noise in stochastic local search: analysis and experiments, Portfolios in stochastic local search: efficiently computing most probable explanations in Bayesian networks, An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives, The minimum shift design problem, Local search algorithms for finding the Hamiltonian completion number of line graphs, Multicriteria optimisation and simulation: an industrial application, On local optima in multiobjective combinatorial optimization problems, Memetic particle swarm optimization, Some effective heuristics for no-wait flowshops with setup times to minimize total completion time, A bi-objective coordination setup problem in a two-stage production system, Iterated local search for the quadratic assignment problem, Neighborhood portfolio approach for local search applied to timetabling problems, Hybrid population-based algorithms for the bi-objective quadratic assignment problem, Ant colony optimization theory: a survey, A Decision-Making Procedure for Resolution-Based SAT-Solvers, Improvements to Hybrid Incremental SAT Algorithms, Speeding-Up Non-clausal Local Search for Propositional Satisfiability with Clause Learning, Discriminative Structure Learning of Markov Logic Networks, Meta-heuristics for Grid Scheduling Problems, The Parameterized Complexity of k-Flip Local Search for SAT and MAX SAT
