Citations (25)
Keep up to date with the latest research on this topic with citation updates for this article.
Read on this site (2)
BAHRAM ALIDAEE, GARYA. KOCHENBERGER & AHMAD AHMADIAN. (1994) 0-1 Quadratic programming approach for optimum solutions of two scheduling problems. International Journal of Systems Science 25:2, pages 401-408.
Read now
Read now
Robert J. Cimikowski. (1994) Branch-and-bound techniques for the maximum planar subgraph problem
. International Journal of Computer Mathematics 53:3-4, pages 135-147.
Read now
Read now
Articles from other publishers (23)
Yuting Tan, Junfeng Zhou, Xinqi Rong, Ming Du & Caiyun Qi. (2023) Efficient computation of maximum weighted independent sets on weighted dynamic graph. The Journal of Supercomputing.
Crossref
Crossref
Kang Zhao, Yuchun Ma, Ruining He, Jixing Zhang, Ning Xu & Jinian Bian. (2023) Adaptive Selection and Clustering of Partial Reconfiguration Modules for Modern FPGA Design Flow. ACM Transactions on Reconfigurable Technology and Systems 16:2, pages 1-24.
Crossref
Crossref
Chun-Tung Li, Jiannong Cao, Chao Ma, Jiaxing Shen & Ka Ho Wong. (2022) An agnostic and efficient approach to identifying features from execution traces. Knowledge-Based Systems 250, pages 108988.
Crossref
Crossref
Chun-Tung Li, Jiannong Cao, Xue Liu & Milos Stojmenovic. (2020) mSIMPAD. ACM Transactions on Computing for Healthcare 1:4, pages 1-19.
Crossref
Crossref
Oren Solomon, Ruud J. G. van Sloun, Hessel Wijkstra, Massimo Mischi & Yonina C. Eldar. (2019) Exploiting Flow Dynamics for Superresolution in Contrast-Enhanced Ultrasound. IEEE Transactions on Ultrasonics, Ferroelectrics, and Frequency Control 66:10, pages 1573-1586.
Crossref
Crossref
Bruno Nogueira, Rian G. S. Pinheiro & Anand Subramanian. (2017) A hybrid iterated local search heuristic for the maximum weight independent set problem. Optimization Letters 12:3, pages 567-583.
Crossref
Crossref
Satoshi Shimizu, Kazuaki Yamaguchi, Toshiki Saitoh & Sumio Masuda. (2017) Fast maximum weight clique extraction algorithm: Optimal tables for branch-and-bound. Discrete Applied Mathematics 223, pages 120-134.
Crossref
Crossref
Ruining He, Yuchun Ma, Kang Zhao & Jinian Bian. (2012) ISBA. ISBA.
Amir Yazdanbakhsh, Mehdi Kamal, Mostafa E. Salehi, Hamid Noori & Sied Mehdi Fakhraie. (2010) Energy-aware design space exploration of registerfile for extensible processors. Energy-aware design space exploration of registerfile for extensible processors.
Roy H. Kwon, Georgios V. Dalakouras & Cheng Wang. (2008) On a posterior evaluation of a simple greedy method for set packing. Optimization Letters 2:4, pages 587-597.
Crossref
Crossref
Sk. Md. Abu Nayeem & Madhumangal Pal. (2007) Genetic algorithmic approach to find the maximum weight independent set of a graph. Journal of Applied Mathematics and Computing 25:1-2, pages 217-229.
Crossref
Crossref
Tuomas Sandholm, Subhash Suri, Andrew Gilpin & David Levine. (2005) CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions. Management Science 51:3, pages 374-390.
Crossref
Crossref
Tuomas Sandholm. (2002) Algorithm for optimal winner determination in combinatorial auctions. Artificial Intelligence 135:1-2, pages 1-54.
Crossref
Crossref
V. Stix, M. Pelillo & I.R. Bomze. (2000) Approximating the maximum weight clique using replicator dynamics. IEEE Transactions on Neural Networks 11:6, pages 1228-1241.
Crossref
Crossref
Patric R.J. Östergård. (1999) A New Algorithm for the Maximum-Weight Clique Problem. Electronic Notes in Discrete Mathematics 3, pages 153-156.
Crossref
Crossref
Shiuh-Pyng Shieh, Chern-Tang Lin & Shianyow Wu. (1999) Optimal assignment of mobile agents for software authorization and protection. Computer Communications 22:1, pages 46-55.
Crossref
Crossref
Immanuel M. Bomze, Marco Budinich, Panos M. Pardalos & Marcello Pelillo. 1999. Handbook of Combinatorial Optimization. Handbook of Combinatorial Optimization
1
74
.
Panos M. Pardalos, Thelma Mavridou & Jue Xue. 1999. Handbook of Combinatorial Optimization. Handbook of Combinatorial Optimization
1077
1141
.
Gang Yu, Panagiotis Kouvelis & Songjun Luo. (1995) Weighted vertex packing problem for specially structured geometric graphs. Naval Research Logistics 42:1, pages 81-102.
Crossref
Crossref
Panos M. Pardalos & Jue Xue. (1994) The maximum clique problem. Journal of Global Optimization 4:3, pages 301-328.
Crossref
Crossref
L. Babel. (1994) A fast algorithm for the maximum weight clique problemEin schneller Algorithmus für das gewichtete Maximum Clique Problem. Computing 52:1, pages 31-38.
Crossref
Crossref
Jue Xue. (2006) Edge‐maximal triangulated subgraphs and heuristics for the maximum clique problem. Networks 24:2, pages 109-120.
Crossref
Crossref
Michel Gendreau, Patrick Soriano & Louis Salvail. (1993) Solving the maximum clique problem using a tabu search approach. Annals of Operations Research 41:4, pages 385-403.
Crossref
Crossref