Relaxation heuristics for a generalized assignment problem (Q1278258): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Luiz Antonio Nogueira Lorena / rank
 
Normal rank
Property / author
 
Property / author: Marcelo Gonçalves Narciso / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: OR-Library / 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.1016/0377-2217(95)00041-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2038841623 / rank
 
Normal rank
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: A survey of algorithms for the generalized assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An all Zero-One Algorithm for a Certain Class of Transportation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for the linear multiple-choice knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact methods for the knapsack problem and its generalizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(n) algorithm for the multiple-choice knapsack linear program / rank
 
Normal rank
Property / cites work
 
Property / cites work: Calculating surrogate constraints / 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: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Surrogate Constraints / 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: The traveling-salesman problem and minimum spanning trees: Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some relationships between lagrangian and surrogate duality in integer programming / 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: A surrogate heuristic for set covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040299 / rank
 
Normal rank

Latest revision as of 18:30, 28 May 2024

scientific article
Language Label Description Also known as
English
Relaxation heuristics for a generalized assignment problem
scientific article

    Statements

    Relaxation heuristics for a generalized assignment problem (English)
    0 references
    10 November 1999
    0 references
    0 references
    heuristics
    0 references
    Lagrangian and surrogate relaxation
    0 references
    generalized assignment problem
    0 references
    0 references