Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
From MaRDI portal
Publication:5550301
DOI10.1287/OPRE.16.5.955zbMath0165.22804OpenAlexW2122448542MaRDI QIDQ5550301
Publication date: 1968
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.16.5.955
Related Items (only showing first 100 items - show all)
A joint replenishment inventory-location model ⋮ The linear ordering problem with clusters: a new partial ranking ⋮ Methods for a network design problem in solar power systems ⋮ A conditional \(p\)-hub location problem with attraction functions ⋮ The stochastic \(p\)-hub center problem with service-level constraints ⋮ A heuristic for large-size \(p\)-median location problems with application to school location ⋮ Towards unified formulations and extensions of two classical probabilistic location models ⋮ On the unified dispersion problem: efficient formulations and exact algorithms ⋮ Making a state-of-the-art heuristic faster with data mining ⋮ Determining optimal police patrol areas with maximal covering and backup covering location models ⋮ Hub location under competition ⋮ A survey of models and algorithms for winter road maintenance. III: Vehicle routing and depot location for spreading ⋮ 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 ⋮ A closed-loop location-inventory problem with spare parts consideration ⋮ An adaptive perturbation-based heuristic: an application to the continuous \(p\)-centre problem ⋮ Heuristic solution approaches to operational forest planning problems ⋮ A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation ⋮ The \(p\)-median problem: a survey of metaheuristic approaches ⋮ The directional \(p\)-median problem: definition, complexity, and algorithms ⋮ The stochastic location model with risk pooling ⋮ The gravity \(p\)-median model ⋮ A genetic algorithm for the \(p\)-median problem with pos/neg weights ⋮ Heuristic algorithms for siting alternative-fuel stations using the flow-refueling location model ⋮ The min-p robust optimization approach for facility location problem under uncertainty ⋮ Computational study of large-scale \(p\)-median problems ⋮ On the exact solution of large-scale simple plant location problems ⋮ Solving the \(p\)-median problem on regular and lattice networks ⋮ An exact algorithm for the capacitated facility location problems with single sourcing ⋮ An efficient heuristic algorithm for the capacitated \(p\)-median problem ⋮ Review of obnoxious facilities location 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 ⋮ A double annealing algorithm for discrete location/allocation problems ⋮ The capacitated plant location problem ⋮ A hybrid artificial bee colony algorithm for the \(p\)-median problem with positive/negative weights ⋮ Continuous approximation models in freight distribution management ⋮ A graph theoretical bound for the p-median problem ⋮ Cournot-Stackelberg games in competitive delocation ⋮ Mathematical Programming Formulations and Algorithms for Discrete k-Median Clustering of Time-Series Data ⋮ Budget constrained location problem with opening and closing of facilities. ⋮ A heuristic for a hybrid FLEET model ⋮ A tree search algorithm for the p-median problem ⋮ A method for solving to optimality uncapacitated location problems ⋮ Location models for airline hubs behaving as \(M/D/c\) queues. ⋮ The complete vertex \(p\)-center problem ⋮ Fast primal and dual heuristics for the \(p\)-median location problem ⋮ Preprocessing for a map sectorization problem by means of mathematical programming ⋮ An ant colony algorithm for the pos/neg weighted \(p\)-median problem ⋮ Optimal partitioning of a data set based on the \(p\)-median model ⋮ An effective heuristic for the \(P\)-median problem with application to ambulance location ⋮ New local searches for solving the multi-source Weber problem ⋮ A LAGRANGIAN-BASED SOLUTION ALGORITHM FOR STRATEGIC SUPPLY CHAIN DISTRIBUTION DESIGN IN UNCERTAIN ENVIRONMENT ⋮ Most recent changepoint detection in censored panel data ⋮ CLUSTERING WEB VISITORS BY BAST, ROBUST AND CONVERGENT ALGORITHMS ⋮ The \(p\)-median problem under uncertainty ⋮ The heuristic concentration-integer and its application to a class of location problems ⋮ A fast swap-based local search procedure for location problems ⋮ A new local search for continuous location problems ⋮ Methods for computing Nash equilibria of a location-quantity game ⋮ Lagrangean relaxation heuristics for the \(p\)-cable-trench problem ⋮ Uncertain multi-objective multi-commodity multi-period multi-vehicle location-allocation model for earthquake evacuation planning ⋮ Discretization and resolution of the \((r| X_ p)\)-medianoid problem involving quality criteria. ⋮ A branch and bound algorithm for determining locations of long-term care facilities ⋮ Algorithms for the design of network topologies with balanced disjoint rings ⋮ Location analysis: a synthesis and survey ⋮ Finding a cluster of points and the grey pattern quadratic assignment problem ⋮ Public facility location using dispersion, population, and equity criteria ⋮ The problem of the optimal placing of the information-technological reserve in distributed data processing systems ⋮ Lagrangean heuristics for location problems ⋮ Strategic facility location: A review ⋮ A gamma heuristic for the \(p\)-median problem ⋮ A Lagrangean heuristic for the maximal covering location problem ⋮ Improved starting solutions for the planar p-median problem ⋮ Applying the flow-capturing location-allocation model to an authentic network: Edmonton, Canada ⋮ Optimal location with equitable loads ⋮ The multiple server center location problem ⋮ 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 ⋮ Exemplar-based clustering via simulated annealing ⋮ Use of location-allocation models in health service development planning in developing nations ⋮ Robust placement of sensors in dynamic water distribution systems ⋮ Lagrangian heuristics for the two-echelon, single-source, capacitated facility location problem ⋮ Heuristic concentration and tabu search: A head to head comparison ⋮ Network distance characteristics that affect computational effort in \(p\)-median location problems ⋮ Location of hubs in a competitive environment ⋮ Towards a unified territorial design approach - applications, algorithms and GIS integration. (With comments and rejoinder) ⋮ 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 ⋮ Fuzzy J-means: a new heuristic for fuzzy clustering ⋮ Hybrid metaheuristic method for determining locations for long-term health care facilities ⋮ Heuristic concentration for the \(p\)-median: An example demonstrating how and why it works ⋮ Analyzing tradeoffs between zonal constraints and accessibility in facility location ⋮ Implementing Larson and Sadiq's location model in a geographic information system ⋮ A repeated matching heuristic for the single-source capacitated facility location problem ⋮ An efficient hybrid particle swarm optimization algorithm for solving the uncapacitated continuous location-allocation problem
This page was built for publication: Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph