Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph

Cited in

(only showing first 100 items - show all)

Optimal location with equitable loads
The multiple server center location problem
Exemplar-based clustering via simulated annealing
Robust placement of sensors in dynamic water distribution systems
Heuristics for the capacitated plant location model
A comparison of two dual-based procedures for solving the p-median problem
A note on solving large p-median problems
Methods for a network design problem in solar power systems
On the exact solution of large-scale simple plant location problems
An exact algorithm for the capacitated facility location problems with single sourcing
A graph theoretical bound for the p-median problem
A tree search algorithm for the p-median problem
Fast primal and dual heuristics for the \(p\)-median location problem
A Lagrangean heuristic for the maximal covering location problem
Applying the flow-capturing location-allocation model to an authentic network: Edmonton, Canada
An efficient tabu search procedure for the p-median problem
Heuristic concentration: Two stage solution construction
A dynamic programming heuristic for the \(P\)-median problem
Lagrangian heuristics for the two-echelon, single-source, capacitated facility location problem
Heuristic concentration and tabu search: A head to head comparison
Location of hubs in a competitive environment
Analyzing tradeoffs between zonal constraints and accessibility in facility location
Implementing Larson and Sadiq's location model in a geographic information system
A heuristic for large-size p-median location problems with application to school location
A double annealing algorithm for discrete location/allocation problems
The capacitated plant location problem
Budget constrained location problem with opening and closing of facilities.
Location models for airline hubs behaving as M/D/c queues.
Use of location-allocation models in health service development planning in developing nations
Heuristic concentration for the p-median: An example demonstrating how and why it works
A repeated matching heuristic for the single-source capacitated facility location problem
Making a state-of-the-art heuristic faster with data mining
A hybrid artificial bee colony algorithm for the p-median problem with positive/negative weights
Continuous approximation models in freight distribution management
Cournot-Stackelberg games in competitive delocation
Lagrangean relaxation heuristics for the \(p\)-cable-trench problem
Location analysis: a synthesis and survey
Lagrangean heuristics for location problems
Strategic facility location: A review
A gamma heuristic for the \(p\)-median problem
Network distance characteristics that affect computational effort in \(p\)-median location problems
Fuzzy J-means: a new heuristic for fuzzy clustering
Towards unified formulations and extensions of two classical probabilistic location models
Heuristic solution approaches to operational forest planning problems
Some heuristic methods for solving p-median problems with a coverage constraint
Design and analysis of hybrid metaheuristics for the reliability \(p\)-median problem
Most recent changepoint detection in censored panel data
Uncertain multi-objective multi-commodity multi-period multi-vehicle location-allocation model for earthquake evacuation planning
The min-p robust optimization approach for facility location problem under uncertainty
The complete vertex \(p\)-center problem
A new local search for continuous location problems
Algorithms for the design of network topologies with balanced disjoint rings
The problem of the optimal placing of the information-technological reserve in distributed data processing systems
Hybrid metaheuristic method for determining locations for long-term health care facilities
Determining optimal police patrol areas with maximal covering and backup covering location models
A bibliography for some fundamental problem categories in discrete location science
A neural model for the p-median problem
BEAMR: an exact and approximate model for the p-median problem
Solving the maximal covering location problem with heuristic concentration
An ant colony algorithm for the pos/neg weighted \(p\)-median problem
The p-median problem under uncertainty
A fast swap-based local search procedure for location problems
Methods for computing Nash equilibria of a location-quantity game
Finding a cluster of points and the grey pattern quadratic assignment problem
Public facility location using dispersion, population, and equity criteria
Towards a unified territorial design approach - applications, algorithms and GIS integration. (With comments and rejoinder)
An efficient hybrid particle swarm optimization algorithm for solving the uncapacitated continuous location-allocation problem
On the unified dispersion problem: efficient formulations and exact algorithms
A joint replenishment inventory-location model
Heuristic algorithms for siting alternative-fuel stations using the flow-refueling location model
Solving the \(p\)-median problem on regular and lattice networks
Review of obnoxious facilities location problems
Mathematical programming formulations and algorithms for discrete k-median clustering of time-series data
CLUSTERING WEB VISITORS BY BAST, ROBUST AND CONVERGENT ALGORITHMS
Hub location under competition
A closed-loop location-inventory problem with spare parts consideration
Improved starting solutions for the planar p-median problem
An adaptive perturbation-based heuristic: an application to the continuous p-centre problem
A Lagrangian-based solution algorithm for strategic supply chain distribution design in uncertain environment
A defensive maximal covering problem on a network
Simultaneous location-allocation of facilities and servers. a generalized heuristic
scientific article; zbMATH DE number 4045779 (Why is no real title available?)
An efficient heuristic algorithm for the capacitated \(p\)-median problem
Heuristicas de descomposicion lagrangiana para algunos problemas de localizacion discreta
Modelle und Verfahren zur Bestimmung betrieblicher und innerbetrieblicher Standorte — Ein Überblick
Recent developments in approximation algorithms for facility location and clustering problems
Preprocessing for a map sectorization problem by means of mathematical programming
A tabu search algorithm for solving the extended maximal availability location problem
Distance‐based mixture modeling for classification via hypothetical local mapping
An effective heuristic for the \(P\)-median problem with application to ambulance location
K-medoids inverse regression
Discrete facility location in machine learning
New local searches for solving the multi-source Weber problem
Ambulance emergency response optimization in developing countries
P-median problems with an additional constraint on the assignment variables
A capacitated facility location problem with constrained backlogging probabilities
Allocating servers to facilities, when demand is elastic to travel and waiting times
Median problems in networks
Heuristics for location models
Lagrangean relaxation-based techniques for solving facility location problems

This page was built for publication: Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5550301)