scientific article; zbMATH DE number 1016966

Authors

Publication date 4 June 1997

Collections of articles of miscellaneous specific interest (00B15) Parallel numerical computation (65Y05) Analysis of algorithms and problem complexity (68Q25) Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming (90-06) Search theory (90B40) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Cited in

(only showing first 100 items - show all)

Revisiting constraint-directed search
The single-finger keyboard layout problem
Optimization, block designs and no free lunch theorems
Structural analysis of local search heuristics in combinatorial optimization
Mechanisms for local search
General local search methods
Order-based neighborhoods for project scheduling with nonregular objective functions.
Simulated annealing for complex portfolio selection problems.
A local search template.
Hybrid flow-shop scheduling problems with multiprocessor task systems.
A heuristic algorithm for solving hazardous materials distribution problems.
Local search for shift design.
An MCDM approach to portfolio optimization.
New quaternary linear codes with covering radius 2
Application of the noising method to the travelling salesman problem
Heuristics for cardinality constrained portfolio optimization
Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing
Local search algorithms for the multiprocessor flow shop scheduling problem
The periodic vehicle routing problem with intermediate facilities
On the convergence of generalized hill climbing algorithms
A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls
A new neighborhood structure for round robin scheduling problems
Tabu search and iterated local search for the cyclic bottleneck assignment problem
Local search inequalities
Heuristic algorithms for the operator-based relocation problem in one-way electric carsharing systems
Extended neighborhood: Definition and characterization
Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling
Covering arrays of strength three from extended permutation vectors
Local search for the Steiner tree problem in the Euclidean plane
Deterministic job-shop scheduling: Past, present and future
An evolutionary heuristic for quadratic 0-1 programming
Local search algorithms for the \(k\)-cardinality tree problem.
Computer search for small complete caps
An improved algorithm for the packing of unequal circles within a larger containing circle
Two-dimensional packing problems: a survey
Application of heuristic methods for conformance test selection
Combining the scalability of local search with the pruning techniques of systematic search
Approximating minimum size \{1,2\}-connected networks
Finding robust solutions using local search
Approximating the Pareto curve with local search for the bicriteria TSP(1,2) problem
Heuristic and exact algorithms for the spanning tree detection problem
Hybrid genetic algorithm for optimization problems with permutation property
Metaheuristics: A bibliography
Parallel local search
Parameterized complexity and local search approaches for the stable marriage problem with ties
A tabu search method guided by shifting bottleneck for the job shop scheduling problem
Record breaking optimization results using the ruin and recreate principle
Dynamic pricing for vehicle ferries: using packing and simulation to optimize revenues
Efficient local search for pseudo Boolean optimization
Local search with a SAT oracle for combinatorial optimization
Comparison of a fuzzy genetic and simulated annealing algorithm approach for project time-cost tradeoff
A heuristic framework on a common generalization of the vehicle routing problem and the linear ordering problem
ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms
A queueing framework for routing problems with time-dependent travel times
A pegging approach to the precedence-constrained knapsack problem
Problems of discrete optimization: challenges and main approaches to solve them
Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm
Setup coordination between two stages of a production system: a multi-objective evolutionary approach
The quadratic three-dimensional assignment problem: exact and approximate solution methods
Generic incremental algorithms for local search
Two new algorithms for UMTS access network topology design
On the minimum volume simplex enclosure problem for estimating a linear mixing model
An exponential (matching based) neighborhood for the vehicle routing problem
A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments
A mixed R{\&}D projects and securities portfolio selection model
Lot sizing and furnace scheduling in small foundries
An analysis of neighborhood functions on generic solution spaces
Convergence properties of the cross-entropy method for discrete optimization
The minimum shift design problem
On local optima in multiobjective combinatorial optimization problems
Exploiting relaxation in local search for LABS
Optimal search strategies using simultaneous generalized hill climbing algorithms
A novel technique of object ranking and classification under ignorance: an application to the corporate failure risk problem
Sequential search and its application to vehicle-routing problems
Noising methods for a clique partitioning problem
Expanding neighborhood GRASP for the traveling salesman problem
Solving the flight perturbation problem with meta heuristics
Creating very large scale neighborhoods out of smaller ones by compounding moves
A dynamic programming methodology in very large scale neighborhood search applied to the traveling salesman problem
A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem
A divide-and-conquer local search heuristic for data visualization
Subthreshold-seeking local search
Neighborhood portfolio approach for local search applied to timetabling problems
The local minima problem in hierarchical classes analysis: an evaluation of a simulated annealing algorithm and various multistart procedures
A simulated annealing algorithm for determining the thickness of a graph
Flowshop scheduling research after five decades
A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices
Heuristics for the maximum outerplanar subgraph problem
A note on single alternating cycle neighborhoods for the TSP
Fast local search algorithms for the handicapped persons transportation problem
A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem
The real-valued model of hierarchical classes
Landscape analysis and efficient metaheuristics for solving the \(n\)-queens problem
On the theoretical properties of swap multimoves
The secure time-dependent vehicle routing problem with uncertain demands
Commonalities in local search
Local search algorithms for combinatorial problems. Analysis, improvements, and new applications (Thesis TU Darmstadt 1998)
Binary trie coding scheme: an intelligent genetic algorithm avoiding premature convergence
Exponential size neighborhoods for makespan minimization scheduling
Hybrid metaheuristics: an introduction

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 Q4339078)