Browsing by Author Brimberg, Jack


Or, select a letter below to browse by last name
0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
Showing results 1 to 20 of 54  next >
Author(s)TitleIssue DateAppears inRank
Elshaikh, Abdalla; Salhi, Said; Brimberg, Jack; Mladenović, Nenad ; Callaghan, Becky; Nagy, GáborAn adaptive perturbation-based heuristic: An application to the continuous p-centre problem1-Nov-2016Computers and Operations Research; 75; 1-11M21
Brimberg, Jack; Hansen, Pierre; Mladenović, Nenad Attraction probabilities in variable neighborhood search1-Jan-20104OR : A Quarterly Journal of Operations Research; 8(2); 181-194M23
Brimberg, Jack; Mladenović, Nenad ; Todosijević, Raca ; Urošević, Dragan A basic variable neighborhood search heuristic for the uncapacitated multiple allocation p-hub center problem1-Feb-2017Optimization Letters; 11(2); 313-327M21
Brimberg, Jack; Todosijević, Raca ; Urošević, Dragan The Classical p-median Problem as a Surrogate Model in Hub Location2024Networks and Spatial Economics~M22
Brimberg, Jack; Hansen, Pierre; Mladenović, Nenad Decomposition strategies for large-scale continuous location-allocation problems1-Jan-2006IMA Journal of Management Mathematics; 17(4); 307-316
Brimberg, Jack; Mladenović, Nenad Degeneracy in the multi-source Weber problem1-Jan-1999Mathematical Programming, Series B; 85(1); 213-220M21a
Mladenović, Nenad ; Brimberg, JackDescent-ascent technique for solving the multi-source Weber problem1-Dec-1995Yugoslav Journal of Operations Research; 5(2); 211-219
Mladenović, Nenad ; Salhi, Said; Hanafi, Said; Brimberg, JackEditorial1-Dec-2014Computers and Operations Research; 52; 147-148M21
Brimberg, Jack; Todosijević, Raca ; Urošević, Dragan ; Mladenović, Nenad Efficient flow models for the uncapacitated multiple allocation p-hub median problem on non-triangular networks1-Dec-2021Computers and Industrial Engineering; 162; 107723~M21
Ratli, Mustapha; Urošević, Dragan ; El Cadi, Abdessamad Ait; Brimberg, Jack; Mladenović, Nenad ; Todosijević, Raca An efficient heuristic for a hub location routing problem28-Nov-2020Optimization LettersM22
Brimberg, Jack; Love, Robert; Mladenović, Nenad Extension of the Weiszfeld procedure to a single facility minisum location model with mixed ℓ p norms1-Oct-2009Mathematical Methods of Operations Research; 70(2); 269-283M23
Mladenović, Nenad ; Brimberg, Jack; Urošević, Dragan Formulation Space Search Metaheuristic2022The Palgrave Handbook of Operations Research; 405-445M14
Brimberg, Jack; Mladenović, Nenad ; Todosijević, Raca ; Urošević, Dragan A general framework for nested variable neighborhood search1-Apr-2017Electronic Notes in Discrete Mathematics; 4th International Conference on Variable Neighborhood Search; 58; 159-166M30
Ilić, Aleksandar; Urošević, Dragan ; Brimberg, Jack; Mladenović, Nenad A general variable neighborhood search for solving the uncapacitated single allocation p-hub median problem16-Oct-2010European Journal of Operational Research; 206(2); 289-300M21a
Brimberg, Jack; Mladenović, Nenad ; Todosijević, Raca ; Urošević, Dragan General variable neighborhood search for the uncapacitated single allocation p-hub center problem1-Feb-2017Optimization Letters; 11(2); 377-388M21
Brimberg, Jack; Drezner, Zvi; Mladenović, Nenad ; Salhi, SaidGenerating good starting solutions for the p-median problem in the plane1-Dec-2012Electronic Notes in Discrete Mathematics; 39; 225-232
Brimberg, Jack; Hansen, Pierre; Mladenović, Nenad ; Taillard, EricImprovements and comparison of heuristics for solving the uncapacitated multisource Weber problem1-Jan-2000Operations Research; 48(3); 444-460M21a
Todosijević, Raca ; Urošević, Dragan ; Mladenović, Nenad ; Brimberg, JackLess Is More Approach1-Jan-2023Discrete Diversity and Dispersion Maximization; 191-220
Mladenović, Nenad ; Drezner, Zvi; Brimberg, Jack; Urošević, Dragan Less Is More Approach in Heuristic Optimization2022The 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 search1-Mar-2017Information Sciences; 382-383; 179-200M21a