Probabilistic tabu search with multiple neighborhoods for the Disjunctively Constrained Knapsack Problem
Year of publication: |
July-September 2017
|
---|---|
Authors: | Ben Salem, Mariem ; Hanafi, Saïd ; Taktak, Raouia ; Ben Abdallah, Hanêne |
Published in: |
RAIRO / Operations research. - Les Ulis : EDP Sciences, ISSN 0399-0559, ZDB-ID 1481534-5. - Vol. 51.2017, 3, p. 627-637
|
Subject: | Probabilistic Tabu Search | knapsack problem | weighted independent set | conflict graph | Ganzzahlige Optimierung | Integer programming | Graphentheorie | Graph theory | Heuristik | Heuristics | Mathematische Optimierung | Mathematical programming | Suchtheorie | Search theory |
-
Adaptive feasible and infeasible evolutionary search for the knapsack problem with forfeits
Zhou, Qing, (2025)
-
Solutions for the knapsack problem with conflict and forcing graphs of bounded clique-width
Gurski, Frank, (2019)
-
Creating seating plans : a practical application
Lewis, Rhyd, (2016)
- More ...
-
Design of survivable networks with low connectivity requirements
Almathkour, Fatmah, (2025)
-
An automated method for the construction of semantic business process patterns
Makni, Lobna, (2018)
-
CA4BPS : an end-to-end context-based approach for business process socialisation
Yahya, Fadwa, (2019)
- More ...