Narrow search
Showing 1 - 8 of 8
Cover Image
Fixed Set Search Matheuristic Applied to the Knapsack Problem with Forfeits
Jovanovic, Raka; Voss, Stefan - 2023
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...
Persistent link: https://www.econbiz.de/10014360668
Cover Image
Matheuristics : Hybridizing Metaheuristics and Mathematical Programming
Maniezzo, Vittorio - 2009
Persistent link: https://www.econbiz.de/10013521246
Cover Image
A note on the rectilinear Steiner aborescence problem
Fink, Andreas; Voß, Stefan - 1994
Persistent link: https://www.econbiz.de/10000917510
Cover Image
An adaptive large neighbourhood search as a matheuristic for the multi-mode resource-constrained project scheduling problem
Gerhards, Patrick; Stürck, Christian; Fink, Andreas - In: European journal of industrial engineering : EJIE 11 (2017) 6, pp. 774-791
Persistent link: https://www.econbiz.de/10011848939
Cover Image
Design and analysis of evolutionary algorithms for the no-wait flow-shop scheduling problem
Czogalla, Jens; Fink, Andreas - In: Metaheuristics in the service industry, (pp. 99-126). 2009
Persistent link: https://www.econbiz.de/10003852190
Cover Image
Particle swarm optimization for scheduling problems
Czogalla, Jens - 2010 - 1. Aufl.
Persistent link: https://www.econbiz.de/10003963700
Cover Image
Fitness landscape analysis for the no-wait flow-shop scheduling problem
Czogalla, Jens; Fink, Andreas - In: Journal of heuristics 18 (2012) 1, pp. 25-51
Persistent link: https://www.econbiz.de/10009505317
Cover Image
A hybridized tabu search approach for the minimum weight vertex cover problem
Voß, Stefan; Fink, Andreas - In: Journal of heuristics 18 (2012) 6, pp. 868-876
Persistent link: https://www.econbiz.de/10009703863