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

From MaRDI portal
Revision as of 03:31, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5550301

DOI10.1287/OPRE.16.5.955zbMath0165.22804OpenAlexW2122448542MaRDI QIDQ5550301

M. B. Teitz, P. Bart

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 modelThe linear ordering problem with clusters: a new partial rankingMethods for a network design problem in solar power systemsA conditional \(p\)-hub location problem with attraction functionsThe stochastic \(p\)-hub center problem with service-level constraintsA heuristic for large-size \(p\)-median location problems with application to school locationTowards unified formulations and extensions of two classical probabilistic location modelsOn the unified dispersion problem: efficient formulations and exact algorithmsMaking a state-of-the-art heuristic faster with data miningDetermining optimal police patrol areas with maximal covering and backup covering location modelsHub location under competitionA survey of models and algorithms for winter road maintenance. III: Vehicle routing and depot location for spreadingA bibliography for some fundamental problem categories in discrete location scienceA neural model for the \(p\)-median problemBEAMR: an exact and approximate model for the \(p\)-median problemSolving the maximal covering location problem with heuristic concentrationA closed-loop location-inventory problem with spare parts considerationAn adaptive perturbation-based heuristic: an application to the continuous \(p\)-centre problemHeuristic solution approaches to operational forest planning problemsA simulated annealing based hyperheuristic for determining shipper sizes for storage and transportationThe \(p\)-median problem: a survey of metaheuristic approachesThe directional \(p\)-median problem: definition, complexity, and algorithmsThe stochastic location model with risk poolingThe gravity \(p\)-median modelA genetic algorithm for the \(p\)-median problem with pos/neg weightsHeuristic algorithms for siting alternative-fuel stations using the flow-refueling location modelThe min-p robust optimization approach for facility location problem under uncertaintyComputational study of large-scale \(p\)-median problemsOn the exact solution of large-scale simple plant location problemsSolving the \(p\)-median problem on regular and lattice networksAn exact algorithm for the capacitated facility location problems with single sourcingAn efficient heuristic algorithm for the capacitated \(p\)-median problemReview of obnoxious facilities location problemsSome heuristic methods for solving \(p\)-median problems with a coverage constraintDesign and analysis of hybrid metaheuristics for the reliability \(p\)-median problemA double annealing algorithm for discrete location/allocation problemsThe capacitated plant location problemA hybrid artificial bee colony algorithm for the \(p\)-median problem with positive/negative weightsContinuous approximation models in freight distribution managementA graph theoretical bound for the p-median problemCournot-Stackelberg games in competitive delocationMathematical Programming Formulations and Algorithms for Discrete k-Median Clustering of Time-Series DataBudget constrained location problem with opening and closing of facilities.A heuristic for a hybrid FLEET modelA tree search algorithm for the p-median problemA method for solving to optimality uncapacitated location problemsLocation models for airline hubs behaving as \(M/D/c\) queues.The complete vertex \(p\)-center problemFast primal and dual heuristics for the \(p\)-median location problemPreprocessing for a map sectorization problem by means of mathematical programmingAn ant colony algorithm for the pos/neg weighted \(p\)-median problemOptimal partitioning of a data set based on the \(p\)-median modelAn effective heuristic for the \(P\)-median problem with application to ambulance locationNew local searches for solving the multi-source Weber problemA LAGRANGIAN-BASED SOLUTION ALGORITHM FOR STRATEGIC SUPPLY CHAIN DISTRIBUTION DESIGN IN UNCERTAIN ENVIRONMENTMost recent changepoint detection in censored panel dataCLUSTERING WEB VISITORS BY BAST, ROBUST AND CONVERGENT ALGORITHMSThe \(p\)-median problem under uncertaintyThe heuristic concentration-integer and its application to a class of location problemsA fast swap-based local search procedure for location problemsA new local search for continuous location problemsMethods for computing Nash equilibria of a location-quantity gameLagrangean relaxation heuristics for the \(p\)-cable-trench problemUncertain multi-objective multi-commodity multi-period multi-vehicle location-allocation model for earthquake evacuation planningDiscretization and resolution of the \((r| X_ p)\)-medianoid problem involving quality criteria.A branch and bound algorithm for determining locations of long-term care facilitiesAlgorithms for the design of network topologies with balanced disjoint ringsLocation analysis: a synthesis and surveyFinding a cluster of points and the grey pattern quadratic assignment problemPublic facility location using dispersion, population, and equity criteriaThe problem of the optimal placing of the information-technological reserve in distributed data processing systemsLagrangean heuristics for location problemsStrategic facility location: A reviewA gamma heuristic for the \(p\)-median problemA Lagrangean heuristic for the maximal covering location problemImproved starting solutions for the planar p-median problemApplying the flow-capturing location-allocation model to an authentic network: Edmonton, CanadaOptimal location with equitable loadsThe multiple server center location problemAn efficient tabu search procedure for the \(p\)-median problemHeuristic concentration: Two stage solution constructionA dynamic programming heuristic for the \(P\)-median problemExemplar-based clustering via simulated annealingUse of location-allocation models in health service development planning in developing nationsRobust placement of sensors in dynamic water distribution systemsLagrangian heuristics for the two-echelon, single-source, capacitated facility location problemHeuristic concentration and tabu search: A head to head comparisonNetwork distance characteristics that affect computational effort in \(p\)-median location problemsLocation of hubs in a competitive environmentTowards a unified territorial design approach - applications, algorithms and GIS integration. (With comments and rejoinder)Heuristics for the capacitated plant location modelA comparison of two dual-based procedures for solving the p-median problemA note on solving large p-median problemsFuzzy J-means: a new heuristic for fuzzy clusteringHybrid metaheuristic method for determining locations for long-term health care facilitiesHeuristic concentration for the \(p\)-median: An example demonstrating how and why it worksAnalyzing tradeoffs between zonal constraints and accessibility in facility locationImplementing Larson and Sadiq's location model in a geographic information systemA repeated matching heuristic for the single-source capacitated facility location problemAn 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