default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJack Brimberg
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j83]Zvi Drezner
, Jack Brimberg, Anita Schöbel:
Dispersed starting solutions in facility location: The case of the planar p-median problem. Comput. Oper. Res. 169: 106726 (2024)- [j82]Jack Brimberg, Pawel Jan Kalczynski, Zvi Drezner:
Different formulations of the gray pattern problem and their optimal solutions. Eur. J. Oper. Res. 316(1): 61-71 (2024) - 2023
- [j81]Jack Brimberg, Saïd Salhi, Raca Todosijevic, Dragan Urosevic:
Variable Neighborhood Search: The power of change and simplicity. Comput. Oper. Res. 155: 106221 (2023) - [j80]Zvi Drezner, Jack Brimberg, Anita Schöbel:
A trajectory based heuristic for the planar p-median problem. Comput. Oper. Res. 158: 106296 (2023) - [j79]Jack Brimberg, Pawel Jan Kalczynski, Zvi Drezner:
The repeated p-dispersion problem. INFOR Inf. Syst. Oper. Res. 61(2): 233-255 (2023) - 2022
- [j78]Jack Brimberg, Stefan Miskovic, Raca Todosijevic, Dragan Urosevic:
The uncapacitated r-allocation p-hub center problem. Int. Trans. Oper. Res. 29(2): 854-878 (2022) - [j77]Mustapha Ratli, Dragan Urosevic, Abdessamad Ait El Cadi, Jack Brimberg, Nenad Mladenovic, Raca Todosijevic:
An efficient heuristic for a hub location routing problem. Optim. Lett. 16(1): 281-300 (2022) - 2021
- [j76]Jack Brimberg, Raca Todosijevic, Dragan Urosevic, Nenad Mladenovic:
Efficient flow models for the uncapacitated multiple allocation p-hub median problem on non-triangular networks. Comput. Ind. Eng. 162: 107723 (2021) - [j75]Jack Brimberg, Andrea Maier, Anita Schöbel:
When closest is not always the best: The distributed p-median problem. J. Oper. Res. Soc. 72(1): 200-216 (2021) - 2020
- [j74]Jun Pei, Nenad Mladenovic, Dragan Urosevic, Jack Brimberg, Xinbao Liu:
Solving the traveling repairman problem with profits: A Novel variable neighborhood search approach. Inf. Sci. 507: 108-123 (2020) - [j73]Jack Brimberg, Nenad Mladenovic, Raca Todosijevic, Dragan Urosevic:
A non-triangular hub location problem. Optim. Lett. 14(5): 1107-1126 (2020) - [i1]Pawel Jan Kalczynski, Jack Brimberg, Zvi Drezner:
The Importance of Good Starting Solutions in the Minimum Sum of Squares Clustering Problem. CoRR abs/2004.04593 (2020)
2010 – 2019
- 2019
- [j72]Jack Brimberg, Nenad Mladenovic, Raca Todosijevic, Dragan Urosevic:
Solving the capacitated clustering problem with variable neighborhood search. Ann. Oper. Res. 272(1-2): 289-321 (2019) - [j71]Becky Callaghan, Saïd Salhi, Jack Brimberg:
Optimal solutions for the continuous p-centre problem and related -neighbour and conditional problems: A relaxation-based algorithm. J. Oper. Res. Soc. 70(2): 192-211 (2019) - [j70]Jack Brimberg, Zvi Drezner:
Solving multiple facilities location problems with separated clusters. Oper. Res. Lett. 47(5): 386-390 (2019) - [e1]Angelo Sifaleras, Saïd Salhi, Jack Brimberg:
Variable Neighborhood Search - 6th International Conference, ICVNS 2018, Sithonia, Greece, October 4-7, 2018, Revised Selected Papers. Lecture Notes in Computer Science 11328, Springer 2019, ISBN 978-3-030-15842-2 [contents] - 2017
- [j69]Jack Brimberg, Nenad Mladenovic, Raca Todosijevic, Dragan Urosevic:
A general framework for nested variable neighborhood search. Electron. Notes Discret. Math. 58: 159-166 (2017) - [j68]Jack Brimberg, Nenad Mladenovic, Raca Todosijevic, Dragan Urosevic:
Less is more: Solving the Max-Mean diversity problem with variable neighborhood search. Inf. Sci. 382-383: 179-200 (2017) - [j67]Jack Brimberg, Nenad Mladenovic, Raca Todosijevic, Dragan Urosevic:
A basic variable neighborhood search heuristic for the uncapacitated multiple allocation p-hub center problem. Optim. Lett. 11(2): 313-327 (2017) - [j66]Jack Brimberg, Nenad Mladenovic, Raca Todosijevic, Dragan Urosevic:
General variable neighborhood search for the uncapacitated single allocation p-hub center problem. Optim. Lett. 11(2): 377-388 (2017) - [j65]Jack Brimberg, Stefana Janicijevic, Nenad Mladenovic, Dragan Urosevic:
Solving the clique partitioning problem as a maximally diverse grouping problem. Optim. Lett. 11(6): 1123-1135 (2017) - 2016
- [j64]Zvi Drezner, Jack Brimberg, Nenad Mladenovic, Saïd Salhi:
New local searches for solving the multi-source Weber problem. Ann. Oper. Res. 246(1-2): 181-203 (2016) - [j63]Abdalla Elshaikh, Saïd Salhi, Jack Brimberg, Nenad Mladenovic, Becky Callaghan, Gábor Nagy:
An adaptive perturbation-based heuristic: An application to the continuous p-centre problem. Comput. Oper. Res. 75: 1-11 (2016) - [c2]Jack Brimberg, Nenad Mladenovic, Raca Todosijevic, Dragan Urosevic:
Variable Neighborhood Descent for the Capacitated Clustering Problem. DOOR 2016: 336-349 - 2015
- [j62]Zvi Drezner, Jack Brimberg, Nenad Mladenovic, Saïd Salhi:
New heuristic algorithms for solving the planar p-median problem. Comput. Oper. Res. 62: 296-304 (2015) - [j61]Jack Brimberg, Nenad Mladenovic, Dragan Urosevic:
Solving the maximally diverse grouping problem by skewed general variable neighborhood search. Inf. Sci. 295: 650-675 (2015) - [j60]Jack Brimberg, Robert Schieweck, Anita Schöbel:
Locating a median line with partial coverage distance. J. Glob. Optim. 62(2): 371-389 (2015) - [j59]Zvi Drezner, Jack Brimberg, Nenad Mladenovic, Saïd Salhi:
Solving the planar p-median problem by variable neighborhood and concentric searches. J. Glob. Optim. 63(3): 501-514 (2015) - [j58]Jack Brimberg, Henrik Juel, Mark-Christoph Körner, Anita Schöbel:
On models for continuous facility location with partial coverage. J. Oper. Res. Soc. 66(1): 33-43 (2015) - [j57]Jack Brimberg, William J. Hurley:
Allocating operating funding in the public sector and the newsvendor problem. J. Oper. Res. Soc. 66(6): 1035-1043 (2015) - 2014
- [j56]Nenad Mladenovic, Saïd Salhi, Saïd Hanafi, Jack Brimberg:
Editorial. Comput. Oper. Res. 52: 147-148 (2014) - [j55]Jack Brimberg, Zvi Drezner, Nenad Mladenovic, Saïd Salhi:
A new local search for continuous location problems. Eur. J. Oper. Res. 232(2): 256-265 (2014) - [j54]Zvi Drezner, Jack Brimberg:
Fitting concentric circles to measurements. Math. Methods Oper. Res. 79(1): 119-133 (2014) - 2013
- [j53]Nenad Mladenovic, Pierre Hansen, Jack Brimberg:
Sequential clustering with radius and split criteria. Central Eur. J. Oper. Res. 21(Supplement-1): 95-115 (2013) - [j52]Jack Brimberg, Zvi Drezner:
A new heuristic for solving the p-median problem in the plane. Comput. Oper. Res. 40(1): 427-437 (2013) - [j51]W. J. Hurley, Jack Brimberg:
Game theory to a friend's rescue. Oper. Res. Lett. 41(4): 366-369 (2013) - 2012
- [j50]Jack Brimberg, Zvi Drezner, Nenad Mladenovic, Saïd Salhi:
Generating good starting solutions for the p-median problem in the plane. Electron. Notes Discret. Math. 39: 225-232 (2012) - [j49]Jack Brimberg, William J. Hurley:
The Role of Chance in Canada's Victory in the 1972 Summit Series. INFOR Inf. Syst. Oper. Res. 50(1): 40-43 (2012) - 2011
- [j48]Jack Brimberg, Henrik Juel, Mark-Christoph Körner, Anita Schöbel:
Locating a general minisum 'circle' on the plane. 4OR 9(4): 351-370 (2011) - [j47]Mark-Christoph Körner, Jack Brimberg, Henrik Juel, Anita Schöbel:
Geometric fit of a point set by generalized circles. J. Glob. Optim. 51(1): 115-132 (2011) - 2010
- [j46]Jack Brimberg, Pierre Hansen, Nenad Mladenovic:
Attraction probabilities in variable neighborhood search. 4OR 8(2): 181-194 (2010) - [j45]Qiu-Hong Zhao, Jack Brimberg, Nenad Mladenovic:
A variable neighborhood search based algorithm for finite-horizon Markov Decision Processes. Appl. Math. Comput. 217(7): 3480-3492 (2010) - [j44]Jack Brimberg, Henrik Juel, Anita Schöbel:
Erratum to "Locating a minisum circle in the plane" [Discrete Appl. Math. 157 (5) (2009) 901-912]. Discret. Appl. Math. 158(18): 2088 (2010) - [j43]Aleksandar Ilic, Dragan Urosevic, Jack Brimberg, Nenad Mladenovic:
A general variable neighborhood search for solving the uncapacitated single allocation p-hub median problem. Eur. J. Oper. Res. 206(2): 289-300 (2010)
2000 – 2009
- 2009
- [j42]Jack Brimberg, Nenad Mladenovic, Dragan Urosevic, Eric Ngai:
Variable neighborhood search for the heaviest k-subgraph. Comput. Oper. Res. 36(11): 2885-2891 (2009) - [j41]Jack Brimberg, Henrik Juel, Anita Schöbel:
Locating a minisum circle in the plane. Discret. Appl. Math. 157(5): 901-912 (2009) - [j40]Pierre Hansen, Jack Brimberg, Dragan Urosevic, Nenad Mladenovic:
Solving large p-median clustering problems by primal-dual variable neighborhood search. Data Min. Knowl. Discov. 19(3): 351-375 (2009) - [j39]W. J. Hurley, Jack Brimberg, Andrey Pavlov:
Optimal thresholds for fining speeders for a stationary speed-check operation when the traffic intensity is low. J. Oper. Res. Soc. 60(9): 1154-1159 (2009) - [j38]W. J. Hurley, Jack Brimberg, Andrey Pavlov:
Improving throughput in a wireless LAN with application to the Canadian army's situational awareness system. J. Oper. Res. Soc. 60(12): 1613-1620 (2009) - [j37]Jack Brimberg, Robert F. Love, Nenad Mladenovic:
Extension of the Weiszfeld procedure to a single facility minisum location model with mixed ℓp norms. Math. Methods Oper. Res. 70(2): 269-283 (2009) - [j36]Jack Brimberg, William J. Hurley:
Are National Hockey League referees Markov? OR Insight 22(4): 234-243 (2009) - [c1]Mark-Christoph Körner, Jack Brimberg, Henrik Juel, Anita Schöbel:
General minisum circle location. CCCG 2009: 111-114 - [r1]Jack Brimberg, George O. Wesolowsky:
Optimizing Facility Location with Euclidean and Rectilinear Distances. Encyclopedia of Optimization 2009: 2869-2873 - 2008
- [j35]Mehdi Zaferanieh, Hossein Taghizadeh Kakhki, Jack Brimberg, George O. Wesolowsky:
A BSSS algorithm for the single facility location problem in two regions with different norms. Eur. J. Oper. Res. 190(1): 79-89 (2008) - [j34]Jack Brimberg, Nenad Mladenovic, Dragan Urosevic:
Local and variable neighborhood search for the k -cardinality subgraph problem. J. Heuristics 14(5): 501-517 (2008) - [j33]Jack Brimberg, Pierre Hansen, Gilbert Laporte, Nenad Mladenovic, Dragan Urosevic:
The maximum return-on-investment plant location problem with market share. J. Oper. Res. Soc. 59(3): 399-406 (2008) - 2007
- [j32]Nenad Mladenovic, Jack Brimberg, Pierre Hansen, José A. Moreno-Pérez:
The p-median problem: A survey of metaheuristic approaches. Eur. J. Oper. Res. 179(3): 927-939 (2007) - [j31]Pierre Hansen, Jack Brimberg, Dragan Urosevic, Nenad Mladenovic:
Primal-Dual Variable Neighborhood Search for the Simple Plant-Location Problem. INFORMS J. Comput. 19(4): 552-564 (2007) - [j30]Jack Brimberg, Henrik Juel, Anita Schöbel:
Locating a Circle on a Sphere. Oper. Res. 55(4): 782-791 (2007) - [j29]Jack Brimberg, Bill Hurley:
Solving the U2 Brainteaser with Integer and Dynamic Programming. INFORMS Trans. Educ. 7(3): 223-227 (2007) - 2006
- [j28]Jack Brimberg, Dragan Urosevic, Nenad Mladenovic:
Variable neighborhood search for the vertex weighted k. Eur. J. Oper. Res. 171(1): 74-84 (2006) - [j27]Nenad Mladenovic, Jack Brimberg, Pierre Hansen:
A note on duality gap in the simple plant location problem. Eur. J. Oper. Res. 174(1): 11-22 (2006) - 2005
- [j26]Jack Brimberg, Saïd Salhi:
A Continuous Location-Allocation Problem with Zone-Dependent Fixed Cost. Ann. Oper. Res. 136(1): 99-115 (2005) - 2004
- [j25]Dragan Urosevic, Jack Brimberg, Nenad Mladenovic:
Variable neighborhood decomposition search for the edge weighted k-cardinality tree problem. Comput. Oper. Res. 31(8): 1205-1213 (2004) - [j24]Jack Brimberg, Nenad Mladenovic, Saïd Salhi:
The multi-source Weber problem with constant opening cost. J. Oper. Res. Soc. 55(6): 640-646 (2004) - [j23]Charles Audet, Jack Brimberg, Pierre Hansen, Sébastien Le Digabel, Nenad Mladenovic:
Pooling Problem: Alternate Formulations and Solution Methods. Manag. Sci. 50(6): 761-776 (2004) - 2003
- [j22]Mokhtar Amami, Jack Brimberg:
Web-based interorganizational information systems for logistics outsourcing. Ann. des Télécommunications 58(1-2): 266-296 (2003) - [j21]Jack Brimberg, Henrik Juel, Anita Schöbel:
Properties of Three-Dimensional Median Line Location Models. Ann. Oper. Res. 122(1-4): 71-85 (2003) - [j20]Jack Brimberg, Hossein Taghizadeh Kakhki, George O. Wesolowsky:
Location Among Regions with Varying Norms. Ann. Oper. Res. 122(1-4): 87-102 (2003) - [j19]Jack Brimberg, Pierre Hansen, Keh-Wei Lin, Nenad Mladenovic, Michèle Breton:
An Oil Pipeline Design Problem. Oper. Res. 51(2): 228-239 (2003) - 2002
- [j18]Jack Brimberg, George O. Wesolowsky:
Minisum Location with Closest Euclidean Distances. Ann. Oper. Res. 111(1-4): 151-165 (2002) - [j17]Jack Brimberg, George O. Wesolowsky:
Locating facilities by minimax relative to closest points of demand areas. Comput. Oper. Res. 29(6): 625-636 (2002) - [j16]Jack Brimberg, Henrik Juel, Anita Schöbel:
Linear Facility Location in Three Dimensions - Models and Solution Methods. Oper. Res. 50(6): 1050-1057 (2002) - [j15]Jack Brimberg, Pierre Hansen, Nenad Mladenovic:
A note on reduction of quadratic and bilinear programs with equality constraints. J. Glob. Optim. 22(1-4): 39-47 (2002) - 2001
- [j14]Jack Brimberg, Charles S. ReVelle, Kenneth E. Rosing:
Response by Brimberg, ReVelle and Rosing. J. Oper. Res. Soc. 52(2): 241-242 (2001) - 2000
- [j13]Jack Brimberg, Pierre Hansen, Nenad Mladenovic, Éric D. Taillard:
Improvement and Comparison of Heuristics for Solving the Uncapacitated Multisource Weber Problem. Oper. Res. 48(3): 444-460 (2000) - [j12]Jack Brimberg, Charles S. ReVelle:
The maximum return-on-investment plant location problem. J. Oper. Res. Soc. 51(6): 729-735 (2000)
1990 – 1999
- 1999
- [j11]Jack Brimberg, William J. Hurley, R. E. Johnson:
A Punt Returner Location Problem. Oper. Res. 47(3): 482-487 (1999) - [j10]Jack Brimberg, Nenad Mladenovic:
Degeneracy in the multi-source Weber problem. Math. Program. 85(1): 213-220 (1999) - 1998
- [j9]Jack Brimberg, Henrik Juel:
A bicriteria model for locating a semi-desirable facility in the plane. Eur. J. Oper. Res. 106(1): 144-151 (1998) - [j8]Jack Brimberg, Robert F. Love:
Solving a Class of Two-Dimensional Uncapacitated Location-Allocation Problems by Dynamic Programming. Oper. Res. 46(5): 702-709 (1998) - [j7]Jack Brimberg, Reuven Chen, Doron Chen:
Accelerating convergence in the Fermat-Weber location problem. Oper. Res. Lett. 22(4-5): 151-157 (1998) - 1995
- [j6]Jack Brimberg:
The Fermat-Weber location problem revisited. Math. Program. 71: 71-76 (1995) - 1993
- [j5]Jack Brimberg, Robert F. Love:
Global Convergence of a Generalized Iterative Procedure for the Minisum Location Problem with lp Distances. Oper. Res. 41(6): 1153-1163 (1993) - [j4]Jack Brimberg, Robert F. Love:
General Considerations on the Use of the Weighted lp Norm as an Empirical Distance Measure. Transp. Sci. 27(4): 341-349 (1993) - 1992
- [j3]Jack Brimberg, Robert F. Love:
Local convergence in a generalized Fermat-Weber problem. Ann. Oper. Res. 40(1): 33-66 (1992) - [j2]Jack Brimberg, George O. Wesolowsky:
Probabilisticlp distances in location models. Ann. Oper. Res. 40(1): 67-75 (1992) - [j1]Jack Brimberg, Robert F. Love:
A New Distance Function for Modeling Travel Distances in a Transportation Network. Transp. Sci. 26(2): 129-137 (1992)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
