
Search the dblp DataBase
Jack Brimberg:
[Publications]
[Author Rank by year]
[Coauthors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
 Jack Brimberg, George O. Wesolowsky
Locating facilities by minimax relative to closest points of demand areas. [Citation Graph (0, 0)][DBLP] Computers & OR, 2002, v:29, n:6, pp:625636 [Journal]
 Dragan Urosevic, Jack Brimberg, Nenad Mladenovic
Variable neighborhood decomposition search for the edge weighted kcardinality tree problem. [Citation Graph (0, 0)][DBLP] Computers & OR, 2004, v:31, n:8, pp:12051213 [Journal]
 Jack Brimberg
The FermatWeber location problem revisited. [Citation Graph (0, 0)][DBLP] Math. Program., 1995, v:71, n:, pp:7176 [Journal]
 Jack Brimberg, Reuven Chen, Doron Chen
Accelerating convergence in the FermatWeber location problem. [Citation Graph (0, 0)][DBLP] Oper. Res. Lett., 1998, v:22, n:45, pp:151157 [Journal]
 Jack Brimberg, Dragan Urosevic, Nenad Mladenovic
Variable neighborhood search for the vertex weighted k. [Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2006, v:171, n:1, pp:7484 [Journal]
 Nenad Mladenovic, Jack Brimberg, Pierre Hansen
A note on duality gap in the simple plant location problem. [Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2006, v:174, n:1, pp:1122 [Journal]
 Nenad Mladenovic, Jack Brimberg, Pierre Hansen, José A. MorenoPérez
The p. [Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2007, v:179, n:3, pp:927939 [Journal]
General minisum circle location. [Citation Graph (, )][DBLP]
Webbased interorganizational information systems for logistics outsourcing. [Citation Graph (, )][DBLP]
Variable neighborhood search for the heaviest ksubgraph. [Citation Graph (, )][DBLP]
Locating a minisum circle in the plane. [Citation Graph (, )][DBLP]
Solving large pmedian clustering problems by primaldual variable neighborhood search. [Citation Graph (, )][DBLP]
Search in 0.097secs, Finished in 0.098secs
