Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique (Q976396): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A level-2 reformulation-linearization technique bound for the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent advances in the solution of quadratic assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The volume algorithm: Producing primal solutions with a subgradient method / 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: An algorithm for finding the \(K\)-best allocations of a tree structured program / rank
 
Normal rank
Property / cites work
 
Property / cites work: Best reduction of the quadratic semi-assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selected topics on assignment problems / 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: The quadratic assignment problem. Theory and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Memetic Heuristic for the Generalized Quadratic Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The service allocation problem at the Gioia Tauro maritime terminal / 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: 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: Lagrangean relaxation. (With comments and rejoinder). / 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: Lower Bounds for the Quadratic Assignment Problem Based upon a Dual Formulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4452814 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quadratic three-dimensional assignment problem: exact and approximate solution methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assignment Problems and the Location of Economic Activities / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Quadratic Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey for the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the multiprocessor assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved partial solution to the task assignment and multiway cut problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound for the zero-one knapsack problem and a branch and bound algorithm / 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: Q4303939 / 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: From linear to semidefinite programming: an algorithm to obtain semidefinite relaxations for bivalent quadratic 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: A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247442 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A reformulation-linearization technique for solving discrete and continuous nonconvex problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulated annealing applied to the process allocation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Process Allocation Problem: a Survey of the Application of Graph-Theoretic and Integer Programming Approaches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4054818 / rank
 
Normal rank

Revision as of 21:43, 2 July 2024

scientific article
Language Label Description Also known as
English
Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique
scientific article

    Statements

    Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    11 June 2010
    0 references
    quadratic assignment
    0 references
    Lagrangean decomposition
    0 references
    reformulation-linearization technique
    0 references
    branch-and-bound
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers