scholarly journals Computational performance evaluation of two integer linear programming models for the minimum common string partition problem

2015 ◽  
Vol 10 (1) ◽  
pp. 189-205 ◽  
Author(s):  
Christian Blum ◽  
Günther R. Raidl
2014 ◽  
Vol 19 (6) ◽  
pp. 503-514 ◽  
Author(s):  
Wei-Che Hsu ◽  
Jay M. Rosenberger ◽  
Neelesh V. Sule ◽  
Melanie L. Sattler ◽  
Victoria C. P. Chen

2021 ◽  
Vol 11 (1) ◽  
pp. 232-240
Author(s):  
Alexander V. Khorkov ◽  
Shamil I. Galiev

Abstract A numerical method for investigating k-coverings of a convex bounded set with circles of two given radii is proposed. Cases with constraints on the distances between the covering circle centers are considered. An algorithm for finding an approximate number of such circles and the arrangement of their centers is described. For certain specific cases, approximate lower bounds of the density of the k-covering of the given domain are found. We use either 0–1 linear programming or general integer linear programming models. Numerical results demonstrating the effectiveness of the proposed methods are presented.


2016 ◽  
Vol 253 (3) ◽  
pp. 570-583 ◽  
Author(s):  
Luiz H. Cherri ◽  
Leandro R. Mundim ◽  
Marina Andretta ◽  
Franklina M.B. Toledo ◽  
José F. Oliveira ◽  
...  

2006 ◽  
Vol 18 (2) ◽  
pp. 137-150 ◽  
Author(s):  
Laleh Behjat ◽  
Anthony Vannelli ◽  
William Rosehart

Sign in / Sign up

Export Citation Format

Share Document