scientific article; zbMATH DE number 2064411
From MaRDI portal
Publication:4461910
zbMath1113.90370MaRDI QIDQ4461910
Publication date: 18 May 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem, Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem, Traveling salesman problem heuristics: leading methods, implementations and latest advances, Exact and heuristic algorithms for the interval data robust assignment problem, Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem, A filter-and-fan approach to the 2D HP model of the protein folding problem, Ejection chain and filter-and-fan methods in combinatorial optimization, Ejection chain and filter-and-fan methods in combinatorial optimization, A mathematical model and a metaheuristic approach for a memory allocation problem, Experimental analysis of heuristics for the bottleneck traveling salesman problem, A filter-and-fan approach to the job shop scheduling problem, Optimization of nearest neighbor classifiers via metaheuristic algorithms for credit risk assessment, Restricted dynamic programming: a flexible framework for solving realistic VRPs, A simple filter-and-fan approach to the facility location problem, Expanding neighborhood GRASP for the traveling salesman problem, Further extension of the TSP assign neighborhood, A path relinking approach with ejection chains for the generalized assignment problem, A note on single alternating cycle neighborhoods for the TSP, Fast local search algorithms for the handicapped persons transportation problem, A new ILP-based refinement heuristic for vehicle routing problems
