Showing results 16 to 35 of 54
< previous
next >
Author(s) | Title | Issue Date | Appears in | Rank |
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; Hansen, Pierre; Mladenović, Nenad ; Taillard, Eric | Improvements and comparison of heuristics for solving the uncapacitated multisource Weber problem | 1-Jan-2000 | Operations Research; 48(3); 444-460 | M21a |
Todosijević, Raca ; Urošević, Dragan ; Mladenović, Nenad ; Brimberg, Jack | Less Is More Approach | 1-Jan-2023 | Discrete Diversity and Dispersion Maximization; 191-220 | |
Mladenović, Nenad ; Drezner, Zvi; Brimberg, Jack; Urošević, Dragan | Less Is More Approach in Heuristic Optimization | 2022 | The Palgrave Handbook of Operations Research; 469-499 | |
Brimberg, Jack; Mladenović, Nenad ; Todosijević, Raca ; Urošević, Dragan | Less is more: Solving the Max-Mean diversity problem with variable neighborhood search | 1-Mar-2017 | Information Sciences; 382-383; 179-200 | M21a |
Brimberg, Jack; Mladenović, Nenad ; Urošević, Dragan | Local and variable neighborhood search for the k-cardinality subgraph problem | 1-Oct-2008 | Journal of Heuristics; 14(5); 501-517 | M22 |
Brimberg, Jack; Mladenović, Nenad ; Todosijević, Raca ; Urošević, Dragan | Local and variable neighborhood searches for solving the capacitated clustering problem | 1-Jan-2017 | Springer Optimization and Its Applications; 130; 33-55 | |
Brimberg, Jack; Mladenović, Nenad ; Urošević, Dragan | Maximally diverse grouping and clique partitioning problems with skewed general variable neighborhood search | 1-Jan-2016 | Springer Proceedings in Mathematics and Statistics; 156; 3-38 | M14 |
Brimberg, Jack; Hansen, Pierre; Laporte, Gilbert; Mladenović, Nenad ; Urošević, Dragan | The maximum return-on-investment plant location problem with market share | 1-Jan-2008 | Journal of the Operational Research Society; 59(3); 399-406 | M22 |
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 |
Brimberg, Jack; Mladenović, Nenad ; Todosijević, Raca ; Urošević, Dragan | A non-triangular hub location problem | 1-Jul-2020 | Optimization Letters; 14; 1107-1126 | M22 |
Mladenović, Nenad ; Brimberg, Jack; Hansen, Pierre | A note on duality gap in the simple plant location problem | 1-Oct-2006 | European Journal of Operational Research; 174(1); 11-22 | M21 |
Brimberg, Jack; Hansen, Pierre; Mladenović, Nenad | A note on reduction of quadratic and bilinear programs with equality constraints | 1-Jan-2002 | Journal of Global Optimization; 22(1-4); 39-47 | M22 |
Brimberg, Jack; Hansen, Pierre; Lih, Keh Wei; Mladenović, Nenad ; Breton, Michèle | An oil pipeline design problem | 1-Jan-2003 | Operations Research; 51(2) | M21 |
Mladenović, Nenad ; Brimberg, Jack; Hansen, Pierre; Moreno-Pérez, José | The p-median problem: A survey of metaheuristic approaches | 16-Jun-2007 | European Journal of Operational Research; 179(3); 927-939 | M21 |
Audet, Charles; Brimberg, Jack; Hansen, Pierre; Le Digabel, Sébastien; Mladenović, Nenad | Pooling problem: Alternate formulations and solution methods | 1-Jun-2004 | Management Science; 50(6); 761-776 | M21a |
Hansen, Pierre; Brimberg, Jack; Urošević, Dragan ; Mladenović, Nenad | Primal-dual variable neighborhood search for the simple plant-location problem | 1-Jan-2007 | INFORMS Journal on Computing; 19(4); 552-564 | M21a |