Lignende værker

• KD-Club: An Efficient Exact Algorithm with New Coloring-based Upper Bound for the Maximum k-Defective Clique Problem
  af: Jin, Mingming, et al.
  Udgivet: (2023)
• An Effective Branch-and-Bound Algorithm with New Bounding Methods for the Maximum $s$-Bundle Problem
  af: Xue, Jinghui, et al.
  Udgivet: (2024)
• Multi-armed Bandit and Backbone boost Lin-Kernighan-Helsgaun Algorithm for the Traveling Salesman Problems
  af: Wang, Long, et al.
  Udgivet: (2025)
• Oblivious Algorithms for Maximum Directed Cut: New Upper and Lower Bounds
  af: Hwang, Samuel, et al.
  Udgivet: (2024)
• A Branch-and-Bound Approach for Maximum Low-Diameter Dense Subgraph Problems
  af: Zhou, Yi, et al.
  Udgivet: (2025)