Zobrazeno 1 - 10
of 488
pro vyhledávání: '"Fred Glover"'
Publikováno v:
Mendel, Vol 26, Iss 1 (2020)
The optimum satisfiability problem involves determining values for Boolean variables to satisfy a Boolean expression, while maximizing the sum of coefficients associated with the variables chosen to be true. Existing literature has identified a tabu
Externí odkaz:
https://doaj.org/article/ee717605f64545fab2786f9517311945
Publikováno v:
European Journal of Operational Research. 309:993-1009
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9f9c649f18a4d5b7da6e86b8c6872702
https://doi.org/10.1016/j.ejor.2023.02.009
https://doi.org/10.1016/j.ejor.2023.02.009
Publikováno v:
European Journal of Operational Research. 308:1037-1055
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::90fdc7941200940ce3c0bce54f73892a
https://doi.org/10.1016/j.ejor.2023.01.001
https://doi.org/10.1016/j.ejor.2023.01.001
Publikováno v:
Applied Intelligence.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3ea508e59a7aa249b20ac1f8dcc45415
https://doi.org/10.1007/s10489-023-04580-x
https://doi.org/10.1007/s10489-023-04580-x
Publikováno v:
INFORMS Journal on Computing.
This paper presents an effective perturbation-based thresholding search for two popular and challenging packing problems with minimal containers: packing N identical circles in a square and packing N identical spheres in a cube. Following the penalty
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::304b2a82b1b3ffc5192ec2ccda2a35bc
https://doi.org/10.1287/ijoc.2023.1290
https://doi.org/10.1287/ijoc.2023.1290
Publikováno v:
Annals of Operations Research. 314:141-183
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e94fa96693f3333445c802e50a8dd51d
https://doi.org/10.1007/s10479-022-04634-2
https://doi.org/10.1007/s10479-022-04634-2
Publikováno v:
INFORMS Journal on Computing. 34:817-833
The minimum connected dominating set (MCDS) problem consists of selecting a minimum set of vertices from an undirected graph, such that each vertex not in this set is adjacent to at least one of the vertices in it, and the subgraph induced by this ve
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e06bb834608317d1edead3b6439cf4f5
https://doi.org/10.1287/ijoc.2021.1106
https://doi.org/10.1287/ijoc.2021.1106
Publikováno v:
Discrete Applied Mathematics. 308:235-254
Scatter Search is an evolutionary metaheuristic introduced by Glover (1977) as a heuristic for integer programming and was joined with a directional rounding strategy for 0–1 Mixed Integer Programming (MIP) problems based on Star Paths in Glover (1
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0b523003c15f1011ff5aebf221299113
https://doi.org/10.1016/j.dam.2020.05.010
https://doi.org/10.1016/j.dam.2020.05.010
