Facets for node packing

DOI10.1016/S0377-2217(96)00175-0zbMath0929.90089MaRDI QIDQ1278997

Richard L. Church, Alan T. Murray

Publication date: 28 February 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

independent set; facets; node packing

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

Related Items

Strategic route extension in transit networks, Optimal reserve site selection with distance requirements, Lagrangean relaxation with clusters for point-feature cartographic label placement problems

Uses Software

• LINDO
• Algorithm 457

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The weighted maximum independent set problem in permutation graphs
• Geometric algorithms and combinatorial optimization
• The maximum clique problem
• Solving the maximum clique problem using a tabu search approach
• Maximal independent sets in bipartite graphs
• An Analysis of Network Location Problems with Distance Constraints
• Finding a Maximum Clique in an Arbitrary Graph
• The maximum independent set problem for cubic planar graphs
• The p-Median and Its Linear Programming Relaxation: An Approach to Large Problems
• Design and Implementation of an Interactive Optimization System for Telephone Network Planning
• A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
• Determining DNA sequence similarity using maximum independent set algorithms for interval graphs
• On the facial structure of set packing polyhedra
• The Location of Emergency Service Facilities
• Algorithm 457: finding all cliques of an undirected graph