A hybrid tabu search/branch \& bound approach to solving the generalized assignment problem (Q992649): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A Rigorous Computational Comparison of Alternative Solution Methods for the Generalized Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid heuristic for the generalized assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid extreme point tabu search / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Hybrid Tabu Search/Branch-and-Bound Algorithm for the Direct Flight Network Design Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for the generalised assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploring relaxation induced neighborhoods to improve MIP solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalized assignment problem with special ordered sets: a polyhedral approach. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search heuristic for the generalized assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local branching / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Multiplier Adjustment Method for the Generalized Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective algorithm and heuristic for the generalized assignment problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Future paths for integer programming and links to artificial intelligence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search—Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search—Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4354785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu search for the multilevel generalized assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid method based on linear programming and tabu search for routing of logging trucks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Generalized Assignment Problem: An Optimizing and Heuristic Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3372332 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches / rank
 
Normal rank
Property / cites work
 
Property / cites work: P-Complete Approximation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Price Algorithm for the Generalized Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993983 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for the generalised assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analyses on the 2 and 3-flip neighborhoods for the MAX SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variable depth search algorithm with branching search for the generalized assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4495204 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A path relinking approach with ejection chains for the generalized assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Ejection Chain Approach for the Generalized Assignment Problem / rank
 
Normal rank

Latest revision as of 04:48, 3 July 2024

scientific article
Language Label Description Also known as
English
A hybrid tabu search/branch \& bound approach to solving the generalized assignment problem
scientific article

    Statements

    A hybrid tabu search/branch \& bound approach to solving the generalized assignment problem (English)
    0 references
    0 references
    0 references
    9 September 2010
    0 references
    integer programming
    0 references
    tabu search
    0 references
    branch and bound
    0 references
    generalized assignment problem
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers