Heuristic search to the capacitated clustering problem (Q1622798): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2018.08.043 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2889505328 / rank
 
Normal rank
Property / cites work
 
Property / cites work: TTT plots: a perl program to create time-to-target plots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experimental Methods for the Analysis of Optimization Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid metaheuristic approach for the capacitated arc routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A reactive GRASP with path relinking for capacitated clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu search and GRASP for the maximum diversity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A priori optimization with recourse for the vehicle routing problem with hard time windows and stochastic service times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4289899 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient memetic algorithm for the graph partitioning problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid evolutionary algorithms for graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tabu Search Heuristic for the Capacitated arc Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic tabu search for large-scale generalized assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Operational research in education / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4354785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterated maxima search for the maximally diverse grouping problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balancing assembly lines with tabu search / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid metaheuristic approach to solving the UBQP problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu search and GRASP for the capacitated clustering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Gentle Introduction to Memetic Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving capacitated clustering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resource constrained routing and scheduling: review and research prospects / rank
 
Normal rank
Property / cites work
 
Property / cites work: An artificial bee colony algorithm for the maximally diverse grouping problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An empirical comparison of heuristic methods for creating maximally diverse groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid metaheuristic method for the maximum diversity problem / rank
 
Normal rank

Latest revision as of 10:08, 17 July 2024

scientific article
Language Label Description Also known as
English
Heuristic search to the capacitated clustering problem
scientific article

    Statements

    Heuristic search to the capacitated clustering problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    19 November 2018
    0 references
    tabu search
    0 references
    memetic algorithm
    0 references
    infeasible local search
    0 references
    capacitated clustering
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers