| Author(s) | Title | Issue Date | Appears in | Rank |
| Elshaikh, Abdalla; Salhi, Said; Brimberg, Jack; Mladenović, Nenad ; Callaghan, Becky; Nagy, Gábor | An adaptive perturbation-based heuristic: An application to the continuous p-centre problem | 1-Nov-2016 | Computers and Operations Research; 75; 1-11 | M21 |
| Mladenović, Nenad ; Salhi, Said; Hanafi, Said; Brimberg, Jack | Editorial | 1-Dec-2014 | Computers and Operations Research; 52; 147-148 | M21 |
| Brimberg, Jack; Drezner, Zvi; Mladenović, Nenad ; Salhi, Said | Generating good starting solutions for the p-median problem in the plane | 1-Dec-2012 | Electronic Notes in Discrete Mathematics; 39; 225-232 | |
| Brimberg, Jack; Mladenović, Nenad ; Salhi, Said | The multi-source Weber problem with constant opening cost | 1-Jan-2004 | Journal of the Operational Research Society; 55(6); 640-646 | M22 |
| Drezner, Zvi; Brimberg, Jack; Mladenović, Nenad ; Salhi, Said | New heuristic algorithms for solving the planar p-median problem | 28-Jul-2015 | Computers and Operations Research; 62; 296-304 | M21 |
| Brimberg, Jack; Drezner, Zvi; Mladenović, Nenad ; Salhi, Said | A new local search for continuous location problems | 1-Jan-2014 | European Journal of Operational Research; 232(2); 256-265 | M21 |
| Drezner, Zvi; Brimberg, Jack; Mladenović, Nenad ; Salhi, Said | New local searches for solving the multi-source Weber problem | 1-Nov-2016 | Annals of Operations Research; 246(1-2); 181-203 | M22 |
| Drezner, Zvi; Brimberg, Jack; Mladenović, Nenad ; Salhi, Said | Solving the planar p-median problem by variable neighborhood and concentric searches | 1-Nov-2015 | Journal of Global Optimization; 63(3); 501-514 | M21 |
| Brimberg, Jack; Drezner, Zvi; Mladenović, Nenad ; Salhi, Said | Using injection points in reformulation local search for solving continuous location problems | 21-Sep-2017 | Yugoslav Journal of Operations Research; 27(3); 291-300 | M51 |
| Brimberg, Jack; Salhi, Said; Todosijević, Raca ; Urošević, Dragan | Variable Neighborhood Search: The power of change and simplicity | 2023 | Computers and Operations Research; 155; 106221 | ~M21 |
