A survey of very large-scale neighborhood search techniques (Q697563): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4339078 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bottleneck assignment problems under categorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the solution of traveling salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time algorithms for NP-hard problems restricted to partial k- trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomially solvable cases of the traveling salesman problem and a new exponential neighborhood / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Travelling Salesman and the PQ-Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new heuristic for the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Halin graphs and the travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Method for Solving Traveling-Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A study of exponential neighborhoods for the travelling salesman problem and for the quadratic assignment problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Clustering Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nurse scheduling with tabu search and strategic oscillation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A vehicle routing improvement algorithm comparison of a ''greedy'' and a matching implementation for inventory routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing efficient simulated annealing algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum Communication Spanning Trees in Series-Parallel Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Principle of Chain-exchange for Vehicle-routeing Problems (1-VRP) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414637 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multi-exchange neighborhood for minimum makespan parallel machine scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data Structures for Traveling Salesmen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ejection chains, reference structures and alternating path methods for traveling salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a best traveling salesman 4-opt move in the same time as a best 2-opt move / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4354785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The travelling salesman problem: new solvable cases and linkages with the development of approximation algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiency of a local algorithm for solving the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential neighbourhood local search for the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small diameter neighbourhood graphs for the traveling salesman problem: At most four moves from tour to tour / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSP tour domination and Hamilton cycle decompositions of regular digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective implementation of the Lin-Kernighan traveling salesman heuristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exponential neighborhood for a one-machine batching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4365133 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Heuristic Procedure for Partitioning Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu search for the multilevel generalized assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3677509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Solutions of the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modified Lin--Kernighan traveling-salesman heuristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesman problem. Approximate algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of the Lin–Kernighan Heuristic for the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSP ejection chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear time algorithm for the bottleneck traveling salesman problem on a Halin graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesman problem: new polynomial approximation algorithms and domination analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination analysis of some heuristics for the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relaxed tours and path ejections for the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Subpath Ejection Method for the Vehicle Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4350082 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesman. Computational solutions for RSP applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3730336 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Computing <i>K</i>-Terminal Reliability in Series-Parallel Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Scaling Algorithm for Multicommodity Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementation of a linear time algorithm for certain generalized traveling salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling tasks on unrelated machines: large neighborhood improvement procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel iterative search methods for vehicle routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic methods for large centroid clustering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time computability of combinatorial problems on series-parallel graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Swapping Applications in a Daily Airline Fleet Assignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Ejection Chain Approach for the Generalized Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4495204 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial combinatorial algorithm for generalized minimum cost flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner problem in Halin networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4350076 / rank
 
Normal rank

Latest revision as of 17:09, 4 June 2024

scientific article
Language Label Description Also known as
English
A survey of very large-scale neighborhood search techniques
scientific article

    Statements

    A survey of very large-scale neighborhood search techniques (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    17 September 2002
    0 references
    0 references
    optimization problems
    0 references
    neighborhood search algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references