scientific article; zbMATH DE number 1016966

Authors

Publication date 4 June 1997

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

Cited in

(only showing first 100 items - show all)

Visiting near-optimal solutions using local search algorithms
A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem
ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms
Two new algorithms for UMTS access network topology design
The real-valued model of hierarchical classes
A multiperiod single processor scheduling problem with periodic requirements
On local search in d.c. optimization problems
Algorithmes hybrides génériques pour la résolution de problèmes de satisfaction de contraintes
Dynamic pricing for vehicle ferries: using packing and simulation to optimize revenues
Generating a mixed mesh of hexahedra, pentahedra and tetrahedra from an underlying tetrahedral mesh
CLASSI: A classification model for the study of sequential processes and individual differences therein
Computing Stable Outcomes in Hedonic Games
Heuristic and metaheuristic methods for computing graph treewidth
Fast local search algorithms for the handicapped persons transportation problem
Sequencing and scheduling for filling lines in dairy production
Subthreshold-seeking local search
A queueing framework for routing problems with time-dependent travel times
Optimization models for targeted offers in direct marketing: exact and heuristic algorithms
Positive role of glassy dynamics in finite-time optimization by threshold algorithms
A framework for analyzing sub-optimal performance of local search algorithms
An exponential (matching based) neighborhood for the vehicle routing problem
Robust optimization of a broad class of heterogeneous vehicle routing problems under demand uncertainty
Sequential search and its application to vehicle-routing problems
A dynamic programming methodology in very large scale neighborhood search applied to the traveling salesman problem
A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments
Inter-depot moves and dynamic-radius search for multi-depot vehicle routing problems
Finding robust solutions using local search
Landscape analysis and efficient metaheuristics for solving the $n$-queens problem
Solving the flight perturbation problem with meta heuristics
Local search with a SAT oracle for combinatorial optimization
Multiple Optimal Solutions in the Portfolio Selection Model with Short-Selling
Using Markov chains to analyze the effectiveness of local search algorithms
Local Search for Max-Sum Diversification
An efficient local search method for random 3-satisfiability
Heuristic algorithms for visiting the customers in a rolling schedule environment
Analyzing the complexity of finding good neighborhood functions for local search algorithms
Setup coordination between two stages of a production system: a multi-objective evolutionary approach
Heuristic and exact algorithms for the spanning tree detection problem
Improved bounds for vehicle routing solutions
Scheduling projects with labor constraints
Local search and lower bounds for the patient admission scheduling problem
An analysis of neighborhood functions on generic solution spaces
Local search inequalities
On the convergence of generalized hill climbing algorithms
A survey of very large-scale neighborhood search techniques
A local search template.
New quaternary linear codes with covering radius 2
scientific article; zbMATH DE number 177832 (Why is no real title available?)
On the minimum volume simplex enclosure problem for estimating a linear mixing model
Mechanisms for local search
Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm
Exploiting relaxation in local search for LABS
The secure time-dependent vehicle routing problem with uncertain demands
Local Search Yields Approximation Schemes for $k$-Means and $k$-Median in Euclidean and Minor-Free Metrics
AN INTEGER L-SHAPED ALGORITHM FOR TIME-CONSTRAINED TRAVELING SALESMAN PROBLEM WITH STOCHASTIC TRAVEL AND SERVICE TIMES
Application of heuristic methods for conformance test selection
Neural networks for facility location problems
A simulated annealing algorithm for determining the thickness of a graph
Multiprogramming genetic algorithm for optimization problems with permutation property
Efficiency of Local Search
Parallel local search
A heuristic framework on a common generalization of the vehicle routing problem and the linear ordering problem
Optimal search strategies using simultaneous generalized hill climbing algorithms
Collaborative optimization of workshop layout and scheduling
Valued constraint satisfaction problems
Combining the scalability of local search with the pruning techniques of systematic search
Computer search for small complete caps
Recent advances on two-dimensional bin packing problems
On the theoretical properties of swap multimoves
Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing
Approximating minimum size \{1,2\}-connected networks
Efficient local search for pseudo Boolean optimization
Heuristics for the traveling repairman problem with profits
Parallel machine scheduling to minimize the makespan with sequence dependent deteriorating effects
Very Large-Scale Neighborhoods with Performance Guarantees for Minimizing Makespan on Parallel Machines
Revisiting constraint-directed search
A novel technique of object ranking and classification under ignorance: an application to the corporate failure risk problem
Local search algorithms for the $k$-cardinality tree problem.
Tabu search and iterated local search for the cyclic bottleneck assignment problem
scientific article; zbMATH DE number 2230236 (Why is no real title available?)
A simulated annealing algorithm for the maximum planar subgraph problem
Equilibria, fixed points, and complexity classes
General local search methods
A mixed R{\&}D projects and securities portfolio selection model
A pegging approach to the precedence-constrained knapsack problem
Graphs and algorithms in communication networks on seven league boots
Dealing with repetitions in sequencing by hybridization
A tabu search method guided by shifting bottleneck for the job shop scheduling problem
The noising methods: A generalization of some metaheuristics
Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling
Heuristics for automated knowledge source integration and service composition
Heuristic algorithms for the operator-based relocation problem in one-way electric carsharing systems
Expanding neighborhood GRASP for the traveling salesman problem
The single-finger keyboard layout problem
Sequence independent lifting for mixed knapsack problems with GUB constraints
An MCDM approach to portfolio optimization.
A fractional model for locating semi-desirable facilities on networks
About the choice of the variable to unassign in a decision repair algorithm
Vector bin packing with heterogeneous bins: application to the machine reassignment problem
The minimum shift design problem

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)