Facets for node packing
From MaRDI portal
Publication:1278997
DOI10.1016/S0377-2217(96)00175-0zbMath0929.90089OpenAlexW1996270513MaRDI QIDQ1278997
Richard L. Church, Alan T. Murray
Publication date: 28 February 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(96)00175-0
Related Items (8)
The disruptive anti-covering location problem ⋮ Optimal reserve site selection with distance requirements ⋮ The stable set problem: clique and nodal inequalities revisited ⋮ Review of obnoxious facilities location problems ⋮ Portfolio optimization through a network approach: network assortative mixing and portfolio diversification ⋮ Lagrangean relaxation with clusters for point-feature cartographic label placement problems ⋮ Worst-case analysis of clique MIPs ⋮ Strategic route extension in transit networks
Uses Software
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
This page was built for publication: Facets for node packing
