Lower bounds and heuristic algorithms for the \(k_i\)-partitioning problem (Q819064): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q59222274, #quickstatements; #temporary_batch_1707252663060
ReferenceBot (talk | contribs)
Changed an Item
(2 intermediate revisions by 2 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/j.ejor.2004.09.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2056047740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(k\)-partitioning problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Application of Bin-Packing to Multiprocessor Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic Methods in the Probabilistic Analysis of Sequencing and Packing Heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Scheduling of Tasks on Identical Parallel Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for the cardinality constrained \(P \|C_{max}\) problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multi-exchange neighborhood for minimum makespan parallel machine scheduling problems / 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: A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4667330 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for Certain Multiprocessing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398369 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applying tabu search with influential diversification to multiprocessor scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2753185 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case analysis of greedy algorithms for the subset-sum problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Algorithm for the Two-Constraint 0–1 Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4546261 / rank
 
Normal rank
Property / cites work
 
Property / cites work: List scheduling algorithms to minimize the makespan on identical parallel machines / rank
 
Normal rank

Revision as of 11:20, 24 June 2024

scientific article
Language Label Description Also known as
English
Lower bounds and heuristic algorithms for the \(k_i\)-partitioning problem
scientific article

    Statements

    Lower bounds and heuristic algorithms for the \(k_i\)-partitioning problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    22 March 2006
    0 references
    partitioning
    0 references
    cardinality constraints
    0 references
    scheduling
    0 references
    parallel machines
    0 references
    bin packing
    0 references
    scatter search
    0 references
    column generation
    0 references

    Identifiers