• Weighted iterated local branching for mathematical programming problems with binary variables 

      Rodrigues, Filipe; Agra, Agostinho; Hvattum, Lars Magnus; Requejo, Cristina (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 

      Rodrigues, Filipe; Agra, Agostinho; Hvattum, Lars Magnus; Requejo, Cristina (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, ...