In this paper we present a heuristic framework that is based on mathematical programming to solve network design problems. Our techniques combine local branching with locally exact refinements. In an iterative strategy an existing solution is refined by solving restricted mixed integer programs...

Optimization Software Class Libraries -- Distribution, Cooperation, and Hybridization for Combinatorial Optimization -- A Framework for Local Search Heuristics for Combinatorial Optimization Problems -- Hotframe: A Heuristic Optimization Framework -- Writing Local Search Algorithms Using...

This paper focuses on solving the knapsack problem with forfeits (KPF). This variation of the knapsack problem includes soft conflicts or forfeits, where forfeit pairs consist of two items and an associated penalty. The proposed method combines the fixed set search (FSS) metaheuristic's learning...