Structural Segmentation of the Minimum Set Cover Problem: Exploiting Universe Decomposability for Metaheuristic Optimization

Documenti analoghi

• A Metaheuristic Algorithm for Large Maximum Weight Independent Set Problems
  di: Dong, Yuanyuan, et al.
  Pubblicazione: (2022)
• Hybrid Metaheuristic Vehicle Routing Problem for Security Dispatch Operations
  di: Vu, Nguyen Gia Hien, et al.
  Pubblicazione: (2025)
• An Efficient Learning-based Solver Comparable to Metaheuristics for the Capacitated Arc Routing Problem
  di: Guo, Runze, et al.
  Pubblicazione: (2024)
• Exploiting Edited Large Language Models as General Scientific Optimizers
  di: Lv, Qitan, et al.
  Pubblicazione: (2025)
• Wave Function Collapse Set Covering and the Hill Climbing Algorithm: A New, Fast Heuristic and Metaheuristic Pairing for the Minimum Set Cover Problem
  di: Oprea, David, et al.
  Pubblicazione: (2025)