Vertex packing problem application to the design of electronic testing fixtures

DOI10.1007/BF02085646zbMath0812.90130OpenAlexW2091868712MaRDI QIDQ1339134

Gang Yu, Songjun Luo, Panagiotis Kouvelis

Publication date: 1 December 1994

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02085646

zbMATH Keywords

designprinted circuit boardsvertex packing

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Production models (90B30) Combinatorial optimization (90C27)

Uses Software

• Algorithm 457

Cites Work

• Unnamed Item
• On stable set polyhedra for K//(1,3)free graphs
• A class of facet producing graphs for vertex packing polyhedra
• On certain polytopes associated with graphs
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• Finding a Maximum Clique in an Arbitrary Graph
• On the Maximum Weight Clique Problem
• Vertex packings: Structural properties and algorithms
• Properties of vertex packing and independence system polyhedra
• On the facial structure of set packing polyhedra
• Algorithm 457: finding all cliques of an undirected graph