Vertex packing problem application to the design of electronic testing fixtures
type: Item
instance of: scholarly article
title: Vertex packing problem application to the design of electronic testing fixtures
zbMATH Open document ID: 0812.90130
DOI: 10.1007/BF02085646
author: Panagiotis Kouvelis
author: Gang Yu
author: Songjun Luo
published in: Annals of Operations Research
publication date: 1994-12-01T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C90
Mathematics Subject Classification ID: 90B30
zbMATH DE Number: 698915
zbMATH Keywords: printed circuit boards
zbMATH Keywords: design
zbMATH Keywords: vertex packing
describes a project that uses: Algorithm 457
MaRDI profile type: Publication
cites work: On the Maximum Weight Clique Problem
cites work: Finding a Maximum Clique in an Arbitrary Graph
cites work: Algorithm 457: finding all cliques of an undirected graph
cites work: On certain polytopes associated with graphs
cites work: On stable set polyhedra for K//(1,3)free graphs
cites work: Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
cites work: Properties of vertex packing and independence system polyhedra
cites work: Vertex packings: Structural properties and algorithms
cites work: Q4040221
cites work: On the facial structure of set packing polyhedra
cites work: A class of facet producing graphs for vertex packing polyhedra
full work available at URL: https://doi.org/10.1007/bf02085646
OpenAlex ID: W2091868712
description: scientific article; zbMATH DE number 698915