A low-rank bilinear programming approach for sub-optimal solution of the quadratic assignment problem
type: Item
instance of: scholarly article
title: A low-rank bilinear programming approach for sub-optimal solution of the quadratic assignment problem
zbMATH Open document ID: 0953.90544
DOI: 10.1016/0377-2217(95)00161-1
author: Abdolhamid Torki
author: Yasutoshi Yajima
author: Takao Enkawa
published in: European Journal of Operational Research
publication date: 1999-02-22T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 1252905
zbMATH Keywords: integer programming
zbMATH Keywords: quadratic assignment problem
zbMATH Keywords: bilinear programming
MaRDI profile type: Publication
full work available at URL: 0377-2217(95)00161-1
OpenAlex ID: W2031385420
cites work: On the Use of Exact and Heuristic Cutting Plane Methods for the Quadratic Assignment Problem
cites work: A branch-and-bound-based heuristic for solving the quadratic assignment problem
cites work: Numerical investigations on quadratic assignment problems
cites work: Quadratic assignment problems
cites work: Q3348691
cites work: A Heuristic Procedure for the Layout of a Large Number of Facilities
cites work: A Successive Underestimation Method for Concave Minimization Problems
cites work: Scheduling Parallel Production Lines with Changeover Costs: Practical Application of a Quadratic Assignment/LP Approach
cites work: Q3997222
cites work: An algorithm for nonconvex programming problems
cites work: A hybrid heuristic for the facilities layout problem
cites work: Assignment Problems and the Location of Economic Activities
cites work: Scalar Invariants of a Rotational System in a Lie Algebra
cites work: Global Minimization of a Linearly Constrained Concave Function by Partition of Feasible Domain
cites work: A distance assignment approach to the facility layout problem
cites work: P-Complete Approximation Problems
cites work: A flexible, polynomial-time, construction and improvement heuristic for the quadratic assignment problem
cites work: Tabu Search Applied to the Quadratic Assignment Problem
cites work: The Backboard Wiring Problem: A Placement Algorithm
cites work: Q5342287
cites work: OUTER APPROXIMATION ALGORITHMS FOR LOWER RANK BILINEAR PROGRAMMING PROBLEMS
description: scientific article; zbMATH DE number 1252905