A low-rank bilinear programming approach for sub-optimal solution of the quadratic assignment problem (Q1278325): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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/0377-2217(95)00161-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2031385420 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Use of Exact and Heuristic Cutting Plane Methods for the Quadratic Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-bound-based heuristic for solving the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical investigations on quadratic assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3348691 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Heuristic Procedure for the Layout of a Large Number of Facilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Successive Underestimation Method for Concave Minimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Parallel Production Lines with Changeover Costs: Practical Application of a Quadratic Assignment/<i>LP</i> Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997222 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for nonconvex programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid heuristic for the facilities layout problem / 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: Scalar Invariants of a Rotational System in a Lie Algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Minimization of a Linearly Constrained Concave Function by Partition of Feasible Domain / rank
 
Normal rank
Property / cites work
 
Property / cites work: A distance assignment approach to the facility layout problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: P-Complete Approximation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A flexible, polynomial-time, construction and improvement heuristic for the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search Applied to the Quadratic Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Backboard Wiring Problem: A Placement Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5342287 / rank
 
Normal rank
Property / cites work
 
Property / cites work: OUTER APPROXIMATION ALGORITHMS FOR LOWER RANK BILINEAR PROGRAMMING PROBLEMS / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:31, 28 May 2024

scientific article
Language Label Description Also known as
English
A low-rank bilinear programming approach for sub-optimal solution of the quadratic assignment problem
scientific article

    Statements

    A low-rank bilinear programming approach for sub-optimal solution of the quadratic assignment problem (English)
    0 references
    0 references
    0 references
    0 references
    22 February 1999
    0 references
    integer programming
    0 references
    quadratic assignment problem
    0 references
    bilinear programming
    0 references
    0 references
    0 references
    0 references

    Identifiers