Jack Brimberg

According to our database1, Jack Brimberg authored at least 73 papers between 1992 and 2020.

Collaborative distances:



In proceedings 
PhD thesis 


On csauthors.net:


Solving the traveling repairman problem with profits: A Novel variable neighborhood search approach.
Inf. Sci., 2020

Optimal solutions for the continuous p-centre problem and related -neighbour and conditional problems: A relaxation-based algorithm.
JORS, 2019

Solving the capacitated clustering problem with variable neighborhood search.
Annals OR, 2019

General variable neighborhood search for the uncapacitated single allocation p-hub center problem.
Optimization Letters, 2017

A basic variable neighborhood search heuristic for the uncapacitated multiple allocation p-hub center problem.
Optimization Letters, 2017

Solving the clique partitioning problem as a maximally diverse grouping problem.
Optimization Letters, 2017

Less is more: Solving the Max-Mean diversity problem with variable neighborhood search.
Inf. Sci., 2017

A general framework for nested variable neighborhood search.
Electronic Notes in Discrete Mathematics, 2017

An adaptive perturbation-based heuristic: An application to the continuous p-centre problem.
Computers & OR, 2016

New local searches for solving the multi-source Weber problem.
Annals OR, 2016

Variable Neighborhood Descent for the Capacitated Clustering Problem.
Proceedings of the Discrete Optimization and Operations Research, 2016

On models for continuous facility location with partial coverage.
JORS, 2015

Allocating operating funding in the public sector and the newsvendor problem.
JORS, 2015

Solving the planar p-median problem by variable neighborhood and concentric searches.
J. Global Optimization, 2015

Locating a median line with partial coverage distance.
J. Global Optimization, 2015

Solving the maximally diverse grouping problem by skewed general variable neighborhood search.
Inf. Sci., 2015

New heuristic algorithms for solving the planar p-median problem.
Computers & OR, 2015

Fitting concentric circles to measurements.
Math. Meth. of OR, 2014

A new local search for continuous location problems.
European Journal of Operational Research, 2014

Computers & OR, 2014

Game theory to a friend's rescue.
Oper. Res. Lett., 2013

A new heuristic for solving the p-median problem in the plane.
Computers & OR, 2013

Sequential clustering with radius and split criteria.
CEJOR, 2013

The Role of Chance in Canada's Victory in the 1972 Summit Series.
INFOR, 2012

Generating good starting solutions for the p-median problem in the plane.
Electronic Notes in Discrete Mathematics, 2012

Geometric fit of a point set by generalized circles.
J. Global Optimization, 2011

Locating a general minisum 'circle' on the plane.
4OR, 2011

A general variable neighborhood search for solving the uncapacitated single allocation p-hub median problem.
European Journal of Operational Research, 2010

Erratum to "Locating a minisum circle in the plane" [Discrete Appl. Math. 157 (5) (2009) 901-912].
Discrete Applied Mathematics, 2010

A variable neighborhood search based algorithm for finite-horizon Markov Decision Processes.
Applied Mathematics and Computation, 2010

Attraction probabilities in variable neighborhood search.
4OR, 2010

Optimizing Facility Location with Euclidean and Rectilinear Distances.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Are National Hockey League referees Markov?
OR Insight, 2009

Extension of the Weiszfeld procedure to a single facility minisum location model with mixed p norms.
Math. Meth. of OR, 2009

Improving throughput in a wireless LAN with application to the Canadian army's situational awareness system.
JORS, 2009

Optimal thresholds for fining speeders for a stationary speed-check operation when the traffic intensity is low.
JORS, 2009

Solving large p-median clustering problems by primal-dual variable neighborhood search.
Data Min. Knowl. Discov., 2009

Locating a minisum circle in the plane.
Discrete Applied Mathematics, 2009

Variable neighborhood search for the heaviest k-subgraph.
Computers & OR, 2009

General minisum circle location.
Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009

The maximum return-on-investment plant location problem with market share.
JORS, 2008

Local and variable neighborhood search for the k -cardinality subgraph problem.
J. Heuristics, 2008

A BSSS algorithm for the single facility location problem in two regions with different norms.
European Journal of Operational Research, 2008

Solving the U2 Brainteaser with Integer and Dynamic Programming.
INFORMS Trans. Education, 2007

Locating a Circle on a Sphere.
Operations Research, 2007

Primal-Dual Variable Neighborhood Search for the Simple Plant-Location Problem.
INFORMS Journal on Computing, 2007

The p-median problem: A survey of metaheuristic approaches.
European Journal of Operational Research, 2007

A note on duality gap in the simple plant location problem.
European Journal of Operational Research, 2006

Variable neighborhood search for the vertex weighted k.
European Journal of Operational Research, 2006

A Continuous Location-Allocation Problem with Zone-Dependent Fixed Cost.
Annals OR, 2005

Pooling Problem: Alternate Formulations and Solution Methods.
Management Science, 2004

The multi-source Weber problem with constant opening cost.
JORS, 2004

Variable neighborhood decomposition search for the edge weighted k-cardinality tree problem.
Computers & OR, 2004

An Oil Pipeline Design Problem.
Operations Research, 2003

Location Among Regions with Varying Norms.
Annals OR, 2003

Properties of Three-Dimensional Median Line Location Models.
Annals OR, 2003

Web-based interorganizational information systems for logistics outsourcing.
Annales des Télécommunications, 2003

A note on reduction of quadratic and bilinear programs with equality constraints.
J. Global Optimization, 2002

Linear Facility Location in Three Dimensions - Models and Solution Methods.
Operations Research, 2002

Locating facilities by minimax relative to closest points of demand areas.
Computers & OR, 2002

Minisum Location with Closest Euclidean Distances.
Annals OR, 2002

Improvement and Comparison of Heuristics for Solving the Uncapacitated Multisource Weber Problem.
Operations Research, 2000

Degeneracy in the multi-source Weber problem.
Math. Program., 1999

A Punt Returner Location Problem.
Operations Research, 1999

Accelerating convergence in the Fermat-Weber location problem.
Oper. Res. Lett., 1998

Solving a Class of Two-Dimensional Uncapacitated Location-Allocation Problems by Dynamic Programming.
Operations Research, 1998

A bicriteria model for locating a semi-desirable facility in the plane.
European Journal of Operational Research, 1998

The Fermat-Weber location problem revisited.
Math. Program., 1995

General Considerations on the Use of the Weighted lp Norm as an Empirical Distance Measure.
Transportation Science, 1993

Global Convergence of a Generalized Iterative Procedure for the Minisum Location Problem with lp Distances.
Operations Research, 1993

A New Distance Function for Modeling Travel Distances in a Transportation Network.
Transportation Science, 1992

Probabilisticlp distances in location models.
Annals OR, 1992

Local convergence in a generalized Fermat-Weber problem.
Annals OR, 1992