The late acceptance hill-climbing heuristic (Q1698884): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Concorde / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2016.07.012 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2108910404 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adaptive artificial bee colony and late-acceptance hill-climbing algorithm for examination timetabling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applied simulated annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Techniques for Producing School Timetables on a Computer and their Application to other Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3425132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The late acceptance hill-climbing heuristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Adaptive Flex-Deluge Approach to University Exam Timetabling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A step counting hill climbing algorithm applied to university examination timetabling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulated Annealing: Searching for an Optimal Temperature Schedule / rank
 
Normal rank
Property / cites work
 
Property / cites work: New optimization heuristics. The great deluge algorithm and the record- to-record travel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Old Bachelor Acceptance: A New Class of Non-Monotone Threshold Accepting Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4365133 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of metaheuristic-based techniques for university timetabling problems / 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: Setting the Research Agenda in Automated Timetabling: The Second International Timetabling Competition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of search methodologies and automated system development for examination timetabling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive memory programming: a unified view of metaheuristics / rank
 
Normal rank

Revision as of 03:43, 15 July 2024

scientific article
Language Label Description Also known as
English
The late acceptance hill-climbing heuristic
scientific article

    Statements

    The late acceptance hill-climbing heuristic (English)
    0 references
    0 references
    0 references
    16 February 2018
    0 references
    combinatorial optimization
    0 references
    metaheuristics
    0 references
    late acceptance hill climbing
    0 references
    timetabling
    0 references
    travelling salesman problem
    0 references
    0 references
    0 references

    Identifiers