The use of dynamic programming in genetic algorithms for permutation problems (Q1268271): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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/0377-2217(94)00301-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2067677003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Linear Ordering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3780902 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692508 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of large-scale symmetric travelling salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Programming Approach to Sequencing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic programming method for single machine scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5187226 / 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: Evolution algorithms in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition algorithm for the single machine total tardiness problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch and Bound Algorithm for the Total Weighted Tardiness Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analysis of Several Heuristics for the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Programming Solution of Sequencing Problems with Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single Machine Scheduling with Precedence Constraints of Dimension 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On estimating the number of order ideals in partial orders, with some applications / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:50, 28 May 2024

scientific article
Language Label Description Also known as
English
The use of dynamic programming in genetic algorithms for permutation problems
scientific article

    Statements

    The use of dynamic programming in genetic algorithms for permutation problems (English)
    0 references
    0 references
    0 references
    18 October 1998
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    dynamic programming
    0 references
    genetic algorithm
    0 references
    single machine scheduling
    0 references
    optimal linear arrangement
    0 references
    traveling salesman
    0 references
    0 references