Facets for node packing
type: Item
instance of: scholarly article
title: Facets for node packing
zbMATH Open document ID: 0929.90089
DOI: 10.1016/S0377-2217(96)00175-0
author: Alan T. Murray
author: Richard L. Church
published in: European Journal of Operational Research
publication date: 1999-02-28T00:00:00Z
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 1255884
zbMATH Keywords: facets
zbMATH Keywords: independent set
zbMATH Keywords: node packing
describes a project that uses: Algorithm 457
describes a project that uses: LINDO
MaRDI profile type: Publication
cites work: Finding a Maximum Clique in an Arbitrary Graph
cites work: Design and Implementation of an Interactive Optimization System for Telephone Network Planning
cites work: Algorithm 457: finding all cliques of an undirected graph
cites work: The maximum independent set problem for cubic planar graphs
cites work: Q4083324
cites work: Q4198056
cites work: Solving the maximum clique problem using a tabu search approach
cites work: Geometric algorithms and combinatorial optimization
cites work: Determining DNA sequence similarity using maximum independent set algorithms for interval graphs
cites work: Maximal independent sets in bipartite graphs
cites work: An Analysis of Network Location Problems with Distance Constraints
cites work: Q4040221
cites work: A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
cites work: On the facial structure of set packing polyhedra
cites work: The maximum clique problem
cites work: The p-Median and Its Linear Programming Relaxation: An Approach to Large Problems
cites work: The Location of Emergency Service Facilities
cites work: Q4124606
cites work: Q3996913
cites work: The weighted maximum independent set problem in permutation graphs
full work available at URL: s0377-2217(96)00175-0
OpenAlex ID: W1996270513
description: scientific article; zbMATH DE number 1255884