Bounds for the Convergence Time of Local Search in Scheduling Problems (Q2959840): 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.1007/978-3-662-54110-4_24 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2559906574 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random knapsack in expected polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving local search heuristics for some scheduling problems. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smoothed performance guarantees for local search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds for worst-case equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance Guarantees for Scheduling Algorithms under Perturbed Machine Speeds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449199 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449200 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear time approximation algorithm for multiprocessor scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Results for Multiprocessor Scheduling under Resource Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for the convergence rate of randomized local search in a multiplayer load-balancing game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local search for multiprocessor scheduling: how many moves does it take to a local optimum? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coordination mechanisms for selfish scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of games possessing pure-strategy Nash equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance Guarantees of Local Search for Multiprocessor Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smoothed analysis of algorithms / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:47, 13 July 2024

scientific article
Language Label Description Also known as
English
Bounds for the Convergence Time of Local Search in Scheduling Problems
scientific article

    Statements

    Bounds for the Convergence Time of Local Search in Scheduling Problems (English)
    0 references
    0 references
    0 references
    0 references
    10 February 2017
    0 references
    0 references
    0 references