A performance guarantee heuristic for electronic components placement problems including thermal effects
type: Item
instance of: scholarly article
title: A performance guarantee heuristic for electronic components placement problems including thermal effects
zbMATH Open document ID: 1071.90580
published in: Computers \& Operations Research
publication date: 2005-06-27T00:00:00Z
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 2183205
zbMATH Keywords: Placement problems
zbMATH Keywords: Quadratic assignment problems
zbMATH Keywords: Combinatorial optimization
zbMATH Keywords: Benders decomposition algorithm
zbMATH Keywords: Electronics cooling
author: G. jun. Miranda
author: Henrique Pacca Loureiro Luna
author: Geraldo Robson Mateus
author: Ricardo P. M. Ferreira
describes a project that uses: QAPLIB
MaRDI profile type: Publication
full work available at URL: j.cor.2004.04.014
OpenAlex ID: W2064711107
cites work: The quadratic assignment problem
cites work: A numerical simulation of the convective heat transfer in confined channel flow past square cylinders: Comparison of inline and offset tandem pairs
cites work: Q3670748
cites work: Optimal tree-shaped networks for fluid flow in a disc-shaped body
cites work: Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
cites work: Dendritic heat convection on a disc.
cites work: P-Complete Approximation Problems
cites work: Q3145800
cites work: Q4321546
cites work: Multicommodity Distribution System Design by Benders Decomposition
cites work: Heuristics for biquadratic assignment problems and their computational comparison
cites work: Constructal design for cooling a disc-shaped area by conduction
cites work: Assignment Problems and the Location of Economic Activities
cites work: Optimization of heat sink mass using the DYNAMIC-Q numerical optimization method
cites work: Location, scheduling, design and integer programming
cites work: Partitioning procedures for solving mixed-variables programming problems
cites work: Q3130241
cites work: Benders' partitioning scheme applied to a new formulation of the quadratic assignment problem
cites work: An algorithm for the quadratic assignment problem using Benders' decomposition
cites work: On the quadratic assignment problem
cites work: Box-inequalities for quadratic assignment polytopes
cites work: Q4550779
cites work: On the SQAP-polytope
cites work: Generalized Benders decomposition
cites work: Q3747197
cites work: Selected topics on assignment problems
cites work: Bender's method revisited
cites work: QAPLIB-A quadratic assignment problem library
cites work: Q4247462
cites work: Solving large quadratic assignment problems on computational grids
cites work: An Algorithm for the Three-Index Assignment Problem
cites work: Q4026491
cites work: A new bound for the quadratic assignment problem based on convex quadratic programming
DOI: 10.1016/J.COR.2004.04.014
description: scientific article; zbMATH DE number 2183205