Jack Brimberg

Comput. Oper. Res., October, 2023

Variable Neighborhood Search: The power of change and simplicity.

[BibT_eX]

[DOI]

Comput. Oper. Res., July, 2023

The repeated p-dispersion problem.

[BibT_eX]

[DOI]

Pawel Jan Kalczynski

INFOR Inf. Syst. Oper. Res., May, 2023

2022

An efficient heuristic for a hub location routing problem.

[BibT_eX]

[DOI]

Mustapha Ratli

Abdessamad Ait El Cadi

Raca Todosijevic

Optim. Lett., 2022

The uncapacitated r-allocation p-hub center problem.

[BibT_eX]

[DOI]

Int. Trans. Oper. Res., 2022

2021

When closest is not always the best: The distributed p-median problem.

[BibT_eX]

[DOI]

Andrea Maier

J. Oper. Res. Soc., 2021

Efficient flow models for the uncapacitated multiple allocation p-hub median problem on non-triangular networks.

[BibT_eX]

[DOI]

Comput. Ind. Eng., 2021

2020

A non-triangular hub location problem.

[BibT_eX]

[DOI]

Optim. Lett., 2020

Solving the traveling repairman problem with profits: A Novel variable neighborhood search approach.

[BibT_eX]

[DOI]

Inf. Sci., 2020

The Importance of Good Starting Solutions in the Minimum Sum of Squares Clustering Problem.

[BibT_eX]

[DOI]

Pawel Jan Kalczynski

CoRR, 2020

2019

Solving multiple facilities location problems with separated clusters.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2019

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

[BibT_eX]

[DOI]

Becky Callaghan

Saïd Salhi

J. Oper. Res. Soc., 2019

Solving the capacitated clustering problem with variable neighborhood search.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2019

2017

General variable neighborhood search for the uncapacitated single allocation p-hub center problem.

[BibT_eX]

[DOI]

Optim. Lett., 2017

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

[BibT_eX]

[DOI]

Optim. Lett., 2017

Solving the clique partitioning problem as a maximally diverse grouping problem.

[BibT_eX]

[DOI]

Optim. Lett., 2017

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

[BibT_eX]

[DOI]

Inf. Sci., 2017

A general framework for nested variable neighborhood search.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

2016

An adaptive perturbation-based heuristic: An application to the continuous p-centre problem.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2016

New local searches for solving the multi-source Weber problem.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2016

Variable Neighborhood Descent for the Capacitated Clustering Problem.

[BibT_eX]

[DOI]

Proceedings of the Discrete Optimization and Operations Research, 2016

2015

On models for continuous facility location with partial coverage.

[BibT_eX]

[DOI]

J. Oper. Res. Soc., 2015

Allocating operating funding in the public sector and the newsvendor problem.

[BibT_eX]

[DOI]

J. Oper. Res. Soc., 2015

Solving the planar p-median problem by variable neighborhood and concentric searches.

[BibT_eX]

[DOI]

J. Glob. Optim., 2015

Locating a median line with partial coverage distance.

[BibT_eX]

[DOI]

Robert Schieweck

J. Glob. Optim., 2015

Solving the maximally diverse grouping problem by skewed general variable neighborhood search.

[BibT_eX]

[DOI]

Inf. Sci., 2015

New heuristic algorithms for solving the planar p-median problem.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2015

2014

Fitting concentric circles to measurements.

[BibT_eX]

[DOI]

Math. Methods Oper. Res., 2014

A new local search for continuous location problems.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2014

Editorial.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2014

2013

Game theory to a friend's rescue.

[BibT_eX]

[DOI]

W. J. Hurley

Oper. Res. Lett., 2013

A new heuristic for solving the p-median problem in the plane.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2013

Sequential clustering with radius and split criteria.

[BibT_eX]

[DOI]

Central Eur. J. Oper. Res., 2013

2012

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

[BibT_eX]

[DOI]

INFOR Inf. Syst. Oper. Res., 2012

Generating good starting solutions for the p-median problem in the plane.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2012

2011

Geometric fit of a point set by generalized circles.

[BibT_eX]

[DOI]

J. Glob. Optim., 2011

Locating a general minisum 'circle' on the plane.

[BibT_eX]

[DOI]

4OR, 2011

2010

A general variable neighborhood search for solving the uncapacitated single allocation p-hub median problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2010

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

[BibT_eX]

[DOI]

Discret. Appl. Math., 2010

A variable neighborhood search based algorithm for finite-horizon Markov Decision Processes.

[BibT_eX]

[DOI]

Qiu-Hong Zhao

Appl. Math. Comput., 2010

Attraction probabilities in variable neighborhood search.

[BibT_eX]

[DOI]

4OR, 2010

2009

Optimizing Facility Location with Euclidean and Rectilinear Distances.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Are National Hockey League referees Markov?

[BibT_eX]

[DOI]

OR Insight, 2009

Extension of the Weiszfeld procedure to a single facility minisum location model with mixed ℓp norms.

[BibT_eX]

[DOI]

Math. Methods Oper. Res., 2009

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

[BibT_eX]

[DOI]

W. J. Hurley

Andrey Pavlov

J. Oper. Res. Soc., 2009

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

[BibT_eX]

[DOI]

W. J. Hurley

Andrey Pavlov

J. Oper. Res. Soc., 2009

Solving large p-median clustering problems by primal-dual variable neighborhood search.

[BibT_eX]

[DOI]

Data Min. Knowl. Discov., 2009

Locating a minisum circle in the plane.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

Variable neighborhood search for the heaviest k-subgraph.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2009

General minisum circle location.

[BibT_eX]

[DOI]

Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009

2008

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

[BibT_eX]

[DOI]

J. Oper. Res. Soc., 2008

Local and variable neighborhood search for the k -cardinality subgraph problem.

[BibT_eX]

[DOI]

Hossein Taghizadeh Kakhki

J. Heuristics, 2008

A BSSS algorithm for the single facility location problem in two regions with different norms.

[BibT_eX]

[DOI]

Mehdi Zaferanieh

Eur. J. Oper. Res., 2008

2007

Solving the U2 Brainteaser with Integer and Dynamic Programming.

[BibT_eX]

Bill Hurley

INFORMS Trans. Educ., 2007

Locating a Circle on a Sphere.

[BibT_eX]

[DOI]

Oper. Res., 2007

Primal-Dual Variable Neighborhood Search for the Simple Plant-Location Problem.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2007

The p-median problem: A survey of metaheuristic approaches.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2007

2006

A note on duality gap in the simple plant location problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2006

Variable neighborhood search for the vertex weighted k.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2006

2005

A Continuous Location-Allocation Problem with Zone-Dependent Fixed Cost.

[BibT_eX]

[DOI]

Saïd Salhi

Ann. Oper. Res., 2005

2004

Pooling Problem: Alternate Formulations and Solution Methods.

[BibT_eX]

[DOI]

Manag. Sci., 2004

The multi-source Weber problem with constant opening cost.

[BibT_eX]

[DOI]

Saïd Salhi

J. Oper. Res. Soc., 2004

Variable neighborhood decomposition search for the edge weighted k-cardinality tree problem.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2004

2003

An Oil Pipeline Design Problem.

[BibT_eX]

[DOI]

Oper. Res., 2003

Location Among Regions with Varying Norms.

[BibT_eX]

[DOI]

Hossein Taghizadeh Kakhki

Ann. Oper. Res., 2003

Properties of Three-Dimensional Median Line Location Models.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2003

Web-based interorganizational information systems for logistics outsourcing.

[BibT_eX]

[DOI]

Mokhtar Amami

Ann. des Télécommunications, 2003

2002

A note on reduction of quadratic and bilinear programs with equality constraints.

[BibT_eX]

[DOI]

J. Glob. Optim., 2002

Linear Facility Location in Three Dimensions - Models and Solution Methods.

[BibT_eX]

[DOI]

Oper. Res., 2002

Locating facilities by minimax relative to closest points of demand areas.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2002

Minisum Location with Closest Euclidean Distances.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2002

2001

Response by Brimberg, ReVelle and Rosing.

[BibT_eX]

[DOI]

Charles S. ReVelle

Kenneth E. Rosing

J. Oper. Res. Soc., 2001

2000

The maximum return-on-investment plant location problem.

[BibT_eX]

[DOI]

Charles S. ReVelle

J. Oper. Res. Soc., 2000

Improvement and Comparison of Heuristics for Solving the Uncapacitated Multisource Weber Problem.

[BibT_eX]

[DOI]

Oper. Res., 2000

1999

Degeneracy in the multi-source Weber problem.

[BibT_eX]

[DOI]

Math. Program., 1999

A Punt Returner Location Problem.

[BibT_eX]

[DOI]

R. E. Johnson

Oper. Res., 1999

1998

Accelerating convergence in the Fermat-Weber location problem.

[BibT_eX]

[DOI]

Reuven Chen

Doron Chen

Oper. Res. Lett., 1998

Solving a Class of Two-Dimensional Uncapacitated Location-Allocation Problems by Dynamic Programming.

[BibT_eX]

[DOI]

Oper. Res., 1998

A bicriteria model for locating a semi-desirable facility in the plane.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 1998

1995

The Fermat-Weber location problem revisited.

[BibT_eX]

[DOI]

Math. Program., 1995

1993

General Considerations on the Use of the Weighted lp Norm as an Empirical Distance Measure.

[BibT_eX]

[DOI]

Transp. Sci., 1993

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

[BibT_eX]

[DOI]

Oper. Res., 1993

1992

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

[BibT_eX]

[DOI]

Transp. Sci., 1992

Probabilisticlp distances in location models.

[BibT_eX]

[DOI]

Ann. Oper. Res., 1992

Local convergence in a generalized Fermat-Weber problem.

[BibT_eX]

[DOI]