Maintaining longest paths incrementally (Q816679): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(8 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: iOpt / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: EasyLocal++ / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Localizer++ / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Localizer / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SALSA / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: COMET / 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/s10601-005-0554-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2006906930 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computational Study of Local Search Algorithms for Job Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138876 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739600 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Temporal constraint networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applying tabu search to the job-shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general approach for constraint solving by local search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SALSA: a language for search algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Localizer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principles and Practice of Constraint Programming – CP 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple tabu search for warehouse location / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Taboo Search Algorithm for the Job Shop Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Incremental Algorithm for a Generalization of the Shortest-Path Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity of dynamic graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving systems of difference constraints incrementally / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved local search for CP toolkits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Amortized Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer priority queues with decrease key in constant time and the single source shortest paths problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization software class libraries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4475684 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Insertion techniques for the heuristic solution of the job shop problem / rank
 
Normal rank

Latest revision as of 11:40, 24 June 2024

scientific article
Language Label Description Also known as
English
Maintaining longest paths incrementally
scientific article

    Statements

    Maintaining longest paths incrementally (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    23 February 2006
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    incremental
    0 references
    longest path
    0 references
    heaviest path
    0 references
    bounded computation
    0 references
    graph
    0 references
    constraint
    0 references
    local search
    0 references
    scheduling
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references