A simulated annealing hyper-heuristic methodology for flexible decision support (Q427562): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q57387721, #quickstatements; #temporary_batch_1706974296281
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Jacek Błażewicz / rank
Normal rank
 
Property / author
 
Property / author: Edmund Kieran Burke / rank
Normal rank
 
Property / author
 
Property / author: Jacek Błażewicz / rank
 
Normal rank
Property / author
 
Property / author: Edmund Kieran Burke / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Bison / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Hyperheuristics / 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.1007/s10288-011-0182-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1963988630 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3500150 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Search Methodologies / rank
 
Normal rank
Property / cites work
 
Property / cites work: A time-predefined approach to course timetabling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Case-based heuristic selection for timetabling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A graph-based hyper-heuristic for educational timetabling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective hybrid algorithm for university course timetabling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2779809 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5688504 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4289899 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New heuristics for one-dimensional bin-packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of metaheuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighbourhood search: Methods and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3494774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of an annealing algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds and reduction procedures for the bin packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993195 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Application of Bayesian approach to numerical methods of global and stochastic optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bayesian heuristic approach to discrete and global optimization. Algorithms, visualization, software, and applications. Incl. 2 disks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A set of examples of global and discrete optimization. Applications of Bayesian heuristic approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybridizations within a graph-based hyper-heuristic framework for university timetabling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449707 / rank
 
Normal rank
Property / cites work
 
Property / cites work: BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Bin‐Packing Problem: A Problem Generator and Some Numerical Experiments with FFD Packing and MTP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for the integer one-dimensional cutting stock problem: A computational study / rank
 
Normal rank

Latest revision as of 08:58, 5 July 2024

scientific article
Language Label Description Also known as
English
A simulated annealing hyper-heuristic methodology for flexible decision support
scientific article

    Statements

    A simulated annealing hyper-heuristic methodology for flexible decision support (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    13 June 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    hyper-heuristics
    0 references
    simulated annealing
    0 references
    bin packing
    0 references
    course timetabling
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references