Theoretical insights into the augmented-neural-network approach for combinatorial optimization (Q2271837): Difference between revisions

From MaRDI portal
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: RAMP / 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/s10479-008-0364-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1972358402 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmented neural networks for task scheduling. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Augmented Neural-Network Approach for Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An electromagnetism-like mechanism for global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for the multidimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non‐greedy heuristics and augmented neural networks for the open‐shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3426438 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid scatter search/electromagnetism meta-heuristic for project scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid scatter search and path relinking for the capacitated \(p\)-median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search—Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692508 / 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: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experimental investigation of heuristics for resource-constrained project scheduling: an update / 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: Principles of scatter search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4382645 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving two location models with few facilities by using a hybrid heuristic: a real health resources case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5692643 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search for the degree-constrained minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Justification and RCPSP: a technique that pays / rank
 
Normal rank

Latest revision as of 21:06, 1 July 2024

scientific article
Language Label Description Also known as
English
Theoretical insights into the augmented-neural-network approach for combinatorial optimization
scientific article

    Statements

    Theoretical insights into the augmented-neural-network approach for combinatorial optimization (English)
    0 references
    0 references
    4 August 2009
    0 references
    0 references
    combinatorial optimization
    0 references
    neural networks
    0 references
    metaheuristics
    0 references
    local search
    0 references
    0 references
    0 references
    0 references