Fixed Set Search Matheuristic Applied to the min-Knapsack Problem with Compactness Constraints and Penalty Values

Results

Naziv:	Fixed Set Search Matheuristic Applied to the min-Knapsack Problem with Compactness Constraints and Penalty Values
Autori:	A. Curebal; S. Voss; R. Jovanović
Godina:	2024
Publikacija:	Lecture Notes in Computer Science, Springer
ISSN:	0302-9743 Lecture Notes in Computer Science / Lecture Notes in Artificial Intelligence Pretraži identifikator
Tip rezultata:	Konferencijski rad
Kolacija:	str. 264-278
DOI:	10.1007/978-3-031-62922-8_18
WoS-ID:	001282250400018
Scopus-ID:	2-s2.0-85199364820
URI:	http://ezaposleni.singidunum.ac.rs/rest/sciNaucniRezultati/oai/record/1/11291 https://link.springer.com/chapter/10.1007/978-3-031-62922-8_18 https://enauka.gov.rs/handle/123456789/974932
M-kategorija:	Mp kategorija će biti prikazana naknadno.

2
SCOPUS^TM

2
WEB OF SCIENCE^TM

Altmetric

Dimensions

Unpaywall

Google Scholar^TM