scientific article

Publication date: 1979

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

algorithms centers Computational complexity logistics medians location on networks multi-objective location optimal facility location

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Deterministic network models in operations research (90B10) Inventory, storage, reservoirs (90B05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Mathematical programming (90C99)

Related Items (97)

Robust solutions to multi-facility Weber location problem under interval and ellipsoidal uncertainty ⋮ On statistical bounds of heuristic solutions to location problems ⋮ Parallel algorithm for finding a core of a tree network ⋮ Location problems with costs being sums of powers of Euclidean distances ⋮ The \(p\)-neighbor \(k\)-center problem ⋮ The \(k\)-neighbor, \(r\)-domination problems on interval graphs ⋮ A fault diagnosis in a nonlinear location network ⋮ Heuristics and bounds for the travelling salesman location problem on the plane ⋮ On eliminating vertices from a tree ⋮ Capacitated, balanced, sequential location-allocation problems on chains and trees ⋮ Geometric optimization and the polynomial hierarchy ⋮ Double bound method for solving the \(p\)-center location problem ⋮ Axiomatic considerations in multi-objective location theory ⋮ Minisum location of a travelling salesman on simple networks ⋮ THE OPTIMAL LOCATION OF A STRUCTURED FACILITY IN A TREE NETWORK ⋮ On covering location problems on networks with edge demand ⋮ The transfer point location problem ⋮ Placing a finite size facility with a center objective on a rectangular plane with barriers ⋮ Upgrading the 1-center problem with edge length variables on a tree ⋮ On a facility location problem with applications to tele-diagnostic ⋮ Group centre and group median of a network ⋮ The \(k\)-ball \(l\)-path branch weight centroid ⋮ The biobjective absolute center problem ⋮ Comments on ‘Facility location problem on network under multiple criteria fuzzy set theoretic approach’ ⋮ A double annealing algorithm for discrete location/allocation problems ⋮ Compact location problems ⋮ Compact location problems with budget and communication constraints ⋮ Covering edges in networks ⋮ Probabilistic single obnoxious facility location with fixed budget ⋮ Complexity and approximability of certain bicriteria location problems ⋮ Developments in network location with mobile and congested facilities ⋮ Reducibility of minimax to minisum 0-1 programming problems ⋮ An algorithm for the minimax Weber problem ⋮ Does Euclidean distance work well when the \(p\)-median model is applied in rural areas? ⋮ Lexicographic local search and the \(p\)-center problem. ⋮ Accretion centers: A generalization of branch weight centroids ⋮ Budget constrained location problem with opening and closing of facilities. ⋮ Sequential competitive location on networks ⋮ A note on locating a central vertex of a 3-cactus graph ⋮ A classification scheme for vehicle routing and scheduling problems ⋮ Uncertain models for single facility location problems on networks ⋮ Discrete facility location with nonlinear diseconomies in fixed costs ⋮ Unnamed Item ⋮ Comparative error bound theory for three location models: continuous demand versus discrete demand ⋮ Product warranty logistics: issues and challenges. ⋮ Balanced location on a graph ⋮ On locating new facilities in a competitive environment ⋮ Locational analysis ⋮ An algorithm for finding the absolute center of a network ⋮ OR models in urban service facility location: a critical review of applications and future developments ⋮ Minisum amd minimax paths of a moving facility on a network ⋮ New relaxation-based algorithms for the optimal solution of the continuous and discrete \(p\)-center problems ⋮ Improving the location of minisum facilities through network modification ⋮ Forecast horizons and dynamic facility location planning ⋮ On worst-case aggregation analysis for network location problems ⋮ Confined location of facilities on a graph ⋮ The fuzzy \(p\)-median problem: a global analysis of the solutions. ⋮ Un nuevo resultado sobre la complejidad del problema delP-centro ⋮ Comparison of \(\alpha\)-Condorcet points with median and center locations ⋮ A relaxation-based algorithm for solving the conditional \(p\)-center problem ⋮ A Mathematical Programming Model for Optimizing a Petroleum Network of Pipelines and Depots ⋮ Multiple criteria facility location problems: a survey ⋮ The minisum location problem on an undirected network with continuous link demands ⋮ A new formulation for the conditional \(p\)-median and \(p\)-center problems ⋮ Efficient algorithms for two generalized 2-median problems and the group median problem on trees ⋮ Confidence in heuristic solutions? ⋮ Locating an absolute center on graphs that are almost trees ⋮ Dominant, an algorithm for the \(p\)-center problem. ⋮ An axiomatic characterization of some locations in trees ⋮ The continuous center set of a network ⋮ Aggregation error for location models: Survey and analysis ⋮ Kinetic maintenance of mobile \(k\)-centres on trees ⋮ A branch-and-bound algorithm for the mini-max spanning forest problem ⋮ Algorithms for the robust 1-center problem on a tree ⋮ An optimal algorithm for solving the 1-median problem on weighted 4-cactus graphs ⋮ The simple plant location problem: Survey and synthesis ⋮ The \(p\)-facility ordered median problem on networks ⋮ Network production-location problems under price uncertainty ⋮ Pendant-medians ⋮ The Bounded Path Tree Problem ⋮ Distance measure and the \(p\)-median problem in rural areas ⋮ A correction to the definition of local center ⋮ A simple plant-location model for quantity-setting firms subject to price uncertainty ⋮ k-Eccentricity and absolute k-centrum of a probabilistic tree ⋮ Location problems ⋮ Sequential location-allocation problems on chains and trees with probabilistic link demands ⋮ Integer programming formulations of discrete hub location problems ⋮ The \(p\) maximal cover -- \(p\) partial center problem on networks ⋮ Network location problems with continuous link demands: p-medians on a chain and 2-medians on a tree ⋮ The zone-constrained location problem on a network ⋮ Location of central nodes in time varying computer networks ⋮ A linear-time algorithm for solving the center problem on weighted cactus graphs ⋮ Algorithmic results for ordered median problems ⋮ On the exponential cardinality of FDS for the ordered \(p\)-median problem ⋮ 'Multidimensional' extensions and a nested dual approach for the m-median problem ⋮ An exact algorithm for the fuzzy p-median problem ⋮ Production and location on a network under demand uncertainty

This page was built for publication: