A survey of algorithms for the generalized assignment problem (Q1199507): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An Integer Generalized Transportation Model for Optimal Job Assignment in Computer Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets of the knapsack polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pivot and Complement–A Heuristic for 0-1 Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear 0–1 programming: I. Linearization techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear 0–1 programming: II. Dominance relations and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The bound improving sequence algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A revised bound improvement sequence algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Lagrangean decomposition: An application to the generalized assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A property of assignment type mixed integer linear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dual-Based Procedure for Uncapacitated Facility Location / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems / 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: Zero-one integer programs with few constraints - Efficient branch and bound algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero-one integer programs with few contraints - lower bounding theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4178782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—An Improved Dual Based Algorithm for the Generalized Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An application-oriented guide for designing Lagrangean dual ascent algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new Lagrangian relaxation approach to the generalized assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid algorithm for the generalized assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note—On the Maximal Covering Location Problem and the Generalized Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3929530 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Assignment with Nonlinear Capacity Interaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for the generalized assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling Facility Location Problems as Generalized Assignment Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact methods for the knapsack problem and its generalizations / rank
 
Normal rank

Latest revision as of 16:17, 16 May 2024

scientific article
Language Label Description Also known as
English
A survey of algorithms for the generalized assignment problem
scientific article

    Statements

    A survey of algorithms for the generalized assignment problem (English)
    0 references
    0 references
    0 references
    16 January 1993
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    minimum cost assignment of jobs to agents
    0 references
    branch-and-bound
    0 references
    heuristics
    0 references
    0 references
    0 references