Analysis of heuristics for finding a maximum weight planar subgraph-Reference-Cited by-同舟云学术

Analysis of heuristics for finding a maximum weight planar subgraph

Published:1985-04 Issue:1 Volume:20 Page:102-114
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Dyer M.E.,Foulds L.R.,Frieze A.M.

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modelling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference16 articles.

1. Plant-layout and materials handling;Apple,1963

2. Allocating facilities with CRAFT;Buffa;Harvard Business Review,1964

3. Campus building arrangements using TOPAZ;Dickey;Transportation Research,1972

4. Hospital layout as a quadratic assignment problem;Elshafei;Operational Research Quarterly,1977

5. Graph theoretic heuristics for the plant layout problem;Foulds;International Journal of Production Research,1978

Cited by 15 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Parallel Filtered Graphs for Hierarchical Clustering;2023 IEEE 39th International Conference on Data Engineering (ICDE);2023-04

2. Exact Algorithms for the Maximum Planar Subgraph Problem;ACM Journal of Experimental Algorithmics;2019-12-17

3. Finding clique clusters with the highest betweenness centrality;European Journal of Operational Research;2018-11

4. STOMA: Simultaneous Template Optimization and Mask Assignment for Directed Self-Assembly Lithography With Multiple Patterning;IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems;2018-06

5. Limits of Greedy Approximation Algorithms for the Maximum Planar Subgraph Problem;Lecture Notes in Computer Science;2016