scientific article
From MaRDI portal
Publication:3993417
zbMath0718.00021MaRDI QIDQ3993417
No author found.
Publication date: 17 September 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming (90-06)
Related Items (only showing first 100 items - show all)
Optimal and heuristic algorithms for multiproduct uncapacitated facility location ⋮ Robust solutions to multi-facility Weber location problem under interval and ellipsoidal uncertainty ⋮ Vehicle driven approaches for non preemptive vehicle relocation with integrated quality criterion in a vehicle sharing system ⋮ A heuristic for BILP problems: the single source capacitated facility location problem ⋮ Combinatorial algorithms for some 1-facility median problems in the plane ⋮ A revised variable neighborhood search for the discrete ordered median problem ⋮ Planar graded lattices and the \(c_1\)-median property ⋮ Combination of MCDM and covering techniques in a hierarchical model for facility location: a case study ⋮ Location of terror response facilities: a game between state and terrorist ⋮ Reverse selective obnoxious center location problems on tree graphs ⋮ Robust vertex \(p\)-center model for locating urgent relief distribution centers ⋮ Location-arc routing problem: heuristic approaches and test instances ⋮ Optimal shift partitioning of pharmacies ⋮ A note on duality gap in the simple plant location problem ⋮ A decomposition approach for the \(p\)-median problem on disconnected graphs ⋮ A branch-and-bound algorithm for the transportation problem with location of \(p\) transshipment points ⋮ A mixed integer nonlinear programming model and heuristic solutions for location, inventory and pricing decisions in a closed loop supply chain ⋮ Optimal Physician assignment and patient demand allocation in an outpatient care network ⋮ The \(p\)-median problem: a survey of metaheuristic approaches ⋮ The uncapacitated facility location problem with demand-dependent setup and service costs and customer-choice allocation ⋮ Placing a finite size facility with a center objective on a rectangular plane with barriers ⋮ The gravity \(p\)-median model ⋮ Strategic design of distribution systems with economies of scale in transportation ⋮ The computational complexity of Steiner tree problems in graded matrices ⋮ The \(p/q\)-\texttt{ACTIVE} uncapacitated facility location problem: investigation of the solution space and an LP-fitting heuristic ⋮ On a facility location problem with applications to tele-diagnostic ⋮ Multiple voting location and single voting location on trees ⋮ The \(k\)-ball \(l\)-path branch weight centroid ⋮ A BSSS algorithm for the location problem with minimum square error ⋮ Discrete location for bundled demand points ⋮ A two-echelon joint continuous-discrete location model ⋮ A note on the nestedness property for ordered median problems in tree networks ⋮ Compact location problems ⋮ Optimal algorithms for inverse vertex obnoxious center location problems on graphs ⋮ Upgrading \(p\)-median problem on a path ⋮ A guided reactive GRASP for the capacitated multi-source Weber problem ⋮ Lessons from the congested clique applied to MapReduce ⋮ Neighborhood search heuristics for the uncapacitated facility location problem ⋮ Supply chain network design under uncertainty: a comprehensive review and future research directions ⋮ Semi-Lagrangian relaxation applied to the uncapacitated facility location problem ⋮ Sequential competitive location on networks ⋮ The root location problem for arc-disjoint arborescences ⋮ A facility location model for air pollution detection ⋮ Product warranty logistics: issues and challenges. ⋮ Scatter search for the single source capacitated facility location problem ⋮ Axioms for consensus functions on the \(n\)-cube ⋮ Threshold robustness in discrete facility location problems: a bi-objective approach ⋮ Parameter tuning for local-search-based matheuristic methods ⋮ A parallelized lagrangean relaxation approach for the discrete ordered median problem ⋮ The capacity and distance constrained plant location problem ⋮ An integrated evaluation of facility location, capacity aquisition, and technology selection for designing global manufacturing strategies ⋮ On worst-case aggregation analysis for network location problems ⋮ Covering a line segment with variable radius discs ⋮ A hybrid hypercube - genetic algorithm approach for deploying many emergency response mobile units in an urban network ⋮ Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees ⋮ An axiomatization of the median procedure on the \(n\)-cube ⋮ Relaxed voting and competitive location under monotonous gain functions on trees ⋮ A simple tabu search for warehouse location ⋮ An \(O(n(\log n)^{2}/\log \log n)\) algorithm for the single maximum coverage location or the \((1,X_p)\)-medianoid problem on trees ⋮ Multiple criteria facility location problems: a survey ⋮ A polynomial method for the pos/neg weighted 3-median problem on a tree ⋮ The equitable dispersion problem ⋮ Sub-logarithmic distributed algorithms for metric facility location ⋮ Norm statistics and the complexity of clustering problems ⋮ Optimally computing all solutions of Stackelberg with parametric prices and of general monotonous gain functions on a tree ⋮ K-center and K-median problems in graded distances ⋮ Inequality measures and equitable locations ⋮ Aggregation error for location models: Survey and analysis ⋮ Optimal location with equitable loads ⋮ Single facility location and relocation problem with time dependent weights and discrete planning horizon ⋮ Up- and downgrading the 1-center in a network ⋮ Facility location and supply chain management. A review ⋮ A flexible model and efficient solution strategies for discrete location problems ⋮ On the lexicographic minimax approach to location problems ⋮ Locating flow-capturing units on a network with multi-counting and diminishing returns to scale ⋮ Locational optimization problems solved through Voronoi diagrams ⋮ Driving tabu search with case-based reasoning ⋮ Algorithms for the robust 1-center problem on a tree ⋮ \((r,p)\)-centroid problems on paths and trees ⋮ Solving the plant location problem on a line by linear programming ⋮ An exact method for the two-echelon, single-source, capacitated facility location problem ⋮ Distribution systems design with role dependent objectives ⋮ Plant location with minimum inventory ⋮ Reverse logistics network design for the collection of end-of-life vehicles in Mexico ⋮ An optimal algorithm for solving the 1-median problem on weighted 4-cactus graphs ⋮ Some personal views on the current state and the future of locational analysis ⋮ Locating and staffing service centers under service level constraints ⋮ Inequality measures and equitable approaches to location problems ⋮ Dynamic facility location when the total number of facilities is uncertain: A decision analysis approach ⋮ Minmax regret solutions for minimax optimization problems with uncertainty ⋮ Models for planning capacity expansion in local access telecommunication networks ⋮ Integer programming formulations of discrete hub location problems ⋮ A linear-time algorithm for solving the center problem on weighted cactus graphs ⋮ A 3-approximation algorithm for the \(k\)-level uncapacitated facility location problem ⋮ On the exponential cardinality of FDS for the ordered \(p\)-median problem ⋮ Heuristic procedures for solving the discrete ordered median problem ⋮ Demand point aggregation for planar covering location models ⋮ The \(K\)-connection location problem in a plane ⋮ Metaheuristic applications on discrete facility location problems: a survey ⋮ Efficient versioning for matrix structures
This page was built for publication: