A matheuristic approach for solving the 2-connected dominating set problem
Sign Up to like & getrecommendations! Published in 2020 at "Applicable Analysis and Discrete Mathematics"
DOI: 10.2298/aadm190227052j
Abstract: This paper describes a matheuristic approach for solving the 2-connected dominating set problem (2-CDS). The goal of the proposed method is to find near optimal solutions for large graphs. The algorithm is based on a… read more here.
Keywords: approach solving; matheuristic approach; dominating set; connected dominating ... See more keywords
A Matheuristic Approach for the No-Wait Flowshop Scheduling Problem with Makespan Criterion
Sign Up to like & getrecommendations! Published in 2022 at "Symmetry"
DOI: 10.3390/sym14050913
Abstract: The No-wait Flowshop Scheduling Problem (NWFSP) has always been a research hotspot because of its importance in various industries. This paper uses a matheuristic approach that combines exact and heuristic algorithms to solve it with… read more here.
Keywords: problem; scheduling problem; matheuristic approach; flowshop scheduling ... See more keywords