Browsing Øvrige samlinger by Journals "Journal of Heuristics"
Now showing items 1-3 of 3
-
Delayed improvement local search
(Peer reviewed; Journal article, 2021)Local search is a fundamental tool in the development of heuristic algorithms. A neighborhood operator takes a current solution and returns a set of similar solutions, denoted as neighbors. In best improvement local search, ... -
Weighted iterated local branching for mathematical programming problems with binary variables
(Peer reviewed; Journal article, 2022)Local search algorithms are frequently used to handle complex optimization problems involving binary decision variables. One way of implementing a local search procedure is by using a mixed-integer programming solver to ... -
Weighted proximity search
(Peer reviewed; Journal article, 2021)Proximity search is an iterative method to solve complex mathematical programming problems. At each iteration, the objective function of the problem at hand is replaced by the Hamming distance function to a given solution, ...