scientific article; zbMATH DE number 821272
From MaRDI portal
Publication:4857376
zbMath0870.90076MaRDI QIDQ4857376
Publication date: 28 November 1995
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
location theoryheuristicsnetwork locationroutingmulticriteria problemsdiscrete locationhub locationmedian problemsundesirable facilitiescenter problemsLagrangean techniquesfixed charge location
Related Items
A study on the budget constrained facility location model considering inventory management cost, A survey of variants and extensions of the location-routing problem, The continuous \(p\)-centre problem: an investigation into variable neighbourhood search with memory, A decomposition approach to solve a bilevel capacitated facility location problem with equity constraints, An efficient algorithm for solving the median problem on real road networks, Location of alternative-fuel stations using the flow-refueling location model and dispersion of candidate sites on arcs, Location of Emergency Facilities with Uncertainty in the Demands, Heuristic algorithms for siting alternative-fuel stations using the flow-refueling location model, The multi-period \(p\)-center problem with time-dependent travel times, Unnamed Item, GRASP with strategic oscillation for the \(\alpha \)-neighbor \(p\)-center problem, Approximability results for the $p$-centdian and the converse centdian problems, A faster algorithm for the constrained minimum covering circle problem to expedite solving p‐center problems in an irregularly shaped area with holes, FlowLoc problems with maximum excess flow, Covering edges in networks, Location Science in Canada, The two-echelon stochastic multi-period capacitated location-routing problem, A trajectory based heuristic for the planar \(p\)-median problem, The multilevel facility location and pricing problems: the computational complexity and the stability analysis, Competitive Multilevel Capacity Allocation, Extensions to the planar \(p\)-median problem, A modified optimal algorithm for 2-maxian location problems on cactus graphs, Unnamed Item, Siting and sizing of facilities under probabilistic demands, Siting and sizing of facilities under probabilistic demands, Optimal Control Strategies for Incoming Inspection, Optimality conditions for distributive justice, An Improved Competitive Algorithm for One-Dimensional Incremental Median Problem, A practical heuristic for maximum coverage in large-scale continuous location problem, The school bus routing and scheduling problem with transfers, Lexicographicα-robustness: an application to the 1-median problem, Static competitive facility location: an overview of optimisation approaches., A particle swarm optimization algorithm with path relinking for the location routing problem, On solving complex multi-period location models using simulated annealing., Solving the uncapacitated facility location problem using tabu search, An exact algorithm for the capacitated vertex \(p\)-center problem, Exact procedures for solving the discrete ordered median problem, Network design for reverse and closed‐loop supply chains: An annotated bibliography of models and solution approaches, A defensive maximal covering problem on a network, Solving thep-Center problem with Tabu Search and Variable Neighborhood Search, Finding a cluster of points and the grey pattern quadratic assignment problem, Exact algorithms for integrated facility location and production planning problems, Linear Time Optimal Approaches for Max-Profit Inverse 1-Median Location Problems, Optimal facility location with random throughput costs, On the circle closest to a set of points, Fast heuristics for large scale covering-location problems, On the use of genetic algorithms to solve location problems, A column generation approach for the maximal covering location problem, Fuzzy partition models for fitting a set of partitions, On the shortest path problem with negative cost cycles, Towards optimizing the deployment of optical access networks, A multi-objective integrated facility location-hardening model: analyzing the pre- and post-disruption tradeoff, Alternative fuel station location model with demand learning, Effectiveness-equity models for facility location problems on tree networks, Pharmacy duty scheduling problem, Mathematical Models and Search Algorithms for the Capacitated p-Center Problem, Allocating servers to facilities, when demand is elastic to travel and waiting times, Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees, P-Median Problems with an Additional Constraint on the Assignment Variables, A facility reliability problem: Formulation, properties, and algorithm, Optimal algorithms for selective variants of the classical and inverse median location problems on trees, A two-echelon inventory-location problem with service considerations, A Branch-and-Price Algorithm for Facility Location with General Facility Cost Functions, Models and algorithms for the screen line-based traffic-counting location problems, The \(p\)-facility ordered median problem on networks, The single-node dynamic service scheduling and dispatching problem, An ABC heuristic for optimizing moveable ambulance station location and vehicle repositioning for the city of São Paulo, Solving the absolute 1-center problem in the quickest path case, Selecting hierarchical facilities in a service-operations environment, Maximal covering code multiplexing access telecommunication networks, A maximal covering location model in the presence of partial coverage, Implementing a mathematical model for locating EMS vehicles in Fayetteville, NC, Effective methods for solving the bi-criteria \(p\)-center and \(p\)-dispersion problem, The planar multifacility collection depots location problem, Cost-optimal topology planning of hierarchical access networks, A scalable exact algorithm for the vertex \(p\)-center problem, Distribution network design for fixed lifetime perishable products: a model and solution approach, The effect of optimizing warehouse locations on omnichannel designs, The minimum equitable radius location problem with continuous demand, An extended covering model for flexible discrete and equity location problems, Solution methods for the bi-objective (cost-coverage) unconstrained facility location problem with an illustrative example, A bibliography for some fundamental problem categories in discrete location science, Regional service coverage modeling, The minimum weighted covering location problem with distance constraints, Dynamic supply chain design with inventory, Siting park-and-ride facilities using a multi-objective spatial optimization model, Modeling data envelopment analysis (DEA) efficient location/allocation decisions, Optimizing location of manufacturing industries in the context of economic globalization: a bi-level model based approach, Sustainable capacitated facility location/network design problem: a non-dominated sorting genetic algorithm based multiobjective approach, Base station location and channel allocation in a cellular network with emergency coverage requirements, Two new algorithms for UMTS access network topology design, Online scheduling problems with flexible release dates: applications to infrastructure restoration, The Weber obnoxious facility location model: a big arc small arc approach, Emergency medical services and beyond: addressing new challenges through a wide literature review, Voronoi diagrams with overlapping regions, A Lagrangian relaxation approach to simultaneous strategic and tactical planning in supply chain design, Location and layout planning. A survey, Some heuristic methods for solving \(p\)-median problems with a coverage constraint, Optimizing the supply chain configuration for make-to-order manufacturing, Integer linear programming models for grid-based light post location problem, A continuous approximation approach for the integrated facility-inventory allocation problem, A stochastic programming model with endogenous and exogenous uncertainty for reliable network design under random disruption, The probabilistic \(p\)-center problem: planning service for potential customers, Covering models and optimization techniques for emergency response facility location and planning: a review, A robust \(p\)-center problem under pressure to locate shelters in wildfire context, A survey of the standard location-routing problem, Does Euclidean distance work well when the \(p\)-median model is applied in rural areas?, Alternate risk measures for emergency medical service system design, A simultaneous inventory control and facility location model with stochastic capacity constraints, Designing a supply chain network under the risk of disruptions, Design of a multiobjective reverse logistics network considering the cost and service level, A hybrid approach using an artificial bee algorithm with mixed integer programming applied to a large-scale capacitated facility location problem, Computation of inverse 1-center location problem on the weighted trapezoid graphs, Recovery strategies from major supply disruptions in single and multiple sourcing networks, ConsNet -- a tabu search approach to the spatially coherent conservation area network design problem, Locating service facilities whose reliability is distance dependent., Solving the bilevel facility location problem under preferences by a Stackelberg-evolutionary algorithm, Product warranty logistics: issues and challenges., Lagrangian relaxation for an inventory location problem with periodic inventory control and stochastic capacity constraints, The obnoxious center problem on weighted cactus graphs., On the overlap area of a disk and a piecewise circular domain, GRASP and VNS for solving the \(p\)-next center problem, OR models in urban service facility location: a critical review of applications and future developments, A hierarchical location model for public facility planning, A multiperiod set covering location model for dynamic redeployment of ambulances, GASUB: finding global optima to discrete location problems by a genetic-like algorithm, RAMP algorithms for the capacitated facility location problem, The obnoxious facilities planar \(p\)-median problem, A heuristic algorithm for solving large location-inventory problems with demand uncertainty, A new compact formulation for the discrete \(p\)-dispersion problem, A generalized Benders decomposition based algorithm for an inventory location problem with stochastic inventory capacity constraints, A taxonomy for emergency service station location problem, A modified variable neighborhood search for the discrete ordered median problem, The stratified \(p\)-center problem, A computational study of a nonlinear minsum facility location problem, A dual bounding scheme for a territory design problem, Maximizing expected coverage of flow and opportunity for diversion in networked systems, An efficient model formulation for level of repair analysis, Algorithms for the design of network topologies with balanced disjoint rings, Designing a two-echelon distribution network under demand uncertainty, Location analysis: a synthesis and survey, Resource allocation for contingency planning: an inexact proximal bundle method for stochastic optimization, Solving multiple facilities location problems with separated clusters, Strategic facility location: A review, Dominant, an algorithm for the \(p\)-center problem., K-center and K-median problems in graded distances, An efficient tabu search procedure for the \(p\)-median problem, Planning models for freight transportation, A dynamic programming heuristic for the \(P\)-median problem, A multiperiod two-echelon multicommodity capacitated plant location problem, An elliptical cover problem in drone delivery network design and its solution algorithms, Improving fairness in ambulance planning by time sharing, Considering short-term and long-term uncertainties in location and capacity planning of public healthcare facilities, The design of robust value-creating supply chain networks: a critical review, Inventory, transportation, service quality and the location of distribution centers, Network distance characteristics that affect computational effort in \(p\)-median location problems, Robustness of solutions to the capacitated facility location problem with uncertain demand, Obnoxious-facility location and data-envelopment analysis: a combined distance-based formula\-tion, Solving the multiple competitive facilities location problem, An approximation algorithm for the facility location problem with lexicographic minimax objective, Distance measure and the \(p\)-median problem in rural areas, Optimal replenishment order placement in a finite time horizon, 2-approximation algorithm for minmax absolute maximum lateness scheduling-location problem, Formulating logical implications in combinatorial optimisation, Exploiting flat subspaces in local search for \(p\)-center problem and two fault-tolerant variants, Application of decision analysis techniques to the Weber facility location problem, Robust weighted vertex \(p\)-center model considering uncertain data: an application to emergency management, Optimizing budget allocation for center and median points, A hybrid clonal selection algorithm for the location routing problem with stochastic demands, On statistical bounds of heuristic solutions to location problems, The stochastic \(p\)-hub center problem with service-level constraints, Equitable service by a facility: minimizing the Gini coefficient, A cross-decomposition scheme with integrated primal-dual multi-cuts for two-stage stochastic programming investment planning problems, The quintile share ratio in location analysis, Optimal deployment of alternative fueling stations on transportation networks considering deviation paths, The connected \(p\)-median problem on block graphs, Capacitated \(p\)-center problem with failure foresight, A facility location model for logistics systems including reverse flows: the case of remanufacturing activities, Combination of MCDM and covering techniques in a hierarchical model for facility location: a case study, Undesirable facility location problems on multicriteria networks, Developing effective meta-heuristics for a probabilistic location model via experimental design, Hybrid column generation for large-size covering integer programs: application to transportation planning, Robust vertex \(p\)-center model for locating urgent relief distribution centers, Double bound method for solving the \(p\)-center location problem, A closed-loop location-inventory problem with spare parts consideration, A hybrid method for the probabilistic maximal covering location-allocation problem, \(p\)-median and \(p\)-dispersion problems: a bi-criteria analysis, An improved Lagrangian relaxation-based heuristic for a joint location-inventory problem, When centers can fail: a close second opportunity, Local search heuristics for the mobile facility location problem, Location modeling for municipal solid waste facilities, Restructuring bank networks after mergers and acquisitions: a capacitated delocation model for closing and resizing branches, A note on duality gap in the simple plant location problem, A simulated annealing for multi-criteria network path problems, Applying ranking and selection procedures to long-term mitigation for improved network restoration, Designing two-echelon supply networks, A simulation-based multi-objective genetic algorithm (SMOGA) procedure for BOT network design problem, The \(p\)-median problem: a survey of metaheuristic approaches, Using clustering analysis in a capacitated location-routing problem, A discrete long-term location--price problem under the assumption of discriminatory pricing: formulations and parametric analysis, The directional \(p\)-median problem: definition, complexity, and algorithms, A dynamic logistics coordination model for evacuation and support in disaster response activities, The stochastic location model with risk pooling, A distribution map for the one-median location problem on a network, Strategic design of distribution systems with economies of scale in transportation, A profit-maximizing supply chain network design model with demand choice flexibility, A review of hierarchical facility location models, A scatter search-based heuristic to locate capacitated transshipment points, A decomposition heuristic for the maximal covering location problem, The impact of US tax depreciation law on asset location and ownership decisions, An exact procedure and LP formulations for the leader-follower location problem, Fuzzy goal programming models for analyzing demand coverage, Weber problems with high-speed lines, Discrete location for bundled demand points, A note on the nestedness property for ordered median problems in tree networks, Static and dynamic source locations in undirected networks, Designing robust coverage networks to hedge against worst-case facility losses, A 16-competitive algorithm for hierarchical median problem, The connected \(p\)-center problem on block graphs with forbidden vertices, Organizing hospitals into networks: a hierarchical and multiservice model to define location, supply and referrals in planned hospital systems, Bee colony optimization for the \(p\)-center problem, Sequential competitive location on networks, Comparative error bound theory for three location models: continuous demand versus discrete demand, Location coverage models with demand originating from nodes and paths: Application to cellular network design, Location-allocation models for traffic police patrol vehicles on an interurban network, Improving emergency service in rural areas: a bi-objective covering location model for EMS systems, Multiple voting location problems, Preprocessing for a map sectorization problem by means of mathematical programming, Threshold robustness in discrete facility location problems: a bi-objective approach, An effective heuristic for the \(P\)-median problem with application to ambulance location, The stochastic capacitated branch restructuring problem, A parallelized lagrangean relaxation approach for the discrete ordered median problem, Maximizing the minimum cover probability by emergency facilities, A decision support model for staff allocation of mobile medical service, The capacity and distance constrained plant location problem, Risk management in uncapacitated facility location models with random demands, New relaxation-based algorithms for the optimal solution of the continuous and discrete \(p\)-center problems, Green supply chains with carbon trading and environmental sourcing: formulation and life cycle assessment, A mixed integer linear program and tabu search approach for the complementary edge covering problem, Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees, A multi-criteria decision making approach for location planning for urban distribution centers under uncertainty, Multi-facility ordered median problems in directed networks, Bi-level programming model and hybrid genetic algorithm for flow interception problem with customer choice, Facility location models for distribution system design, Multiple criteria facility location problems: a survey, A multi-stage facility location problem with staircase costs and splitting of commodities: model, heuristic approach and application, Joint ground and air emergency medical services coverage models: a greedy heuristic solution approach, Optimizing the location of a production firm, Uncapacitated single and multiple allocation \(p\)-hub center problems, Confidence in heuristic solutions?, A genetic algorithm for a single product network design model with lead time and safety stock considerations, A decomposition approach for the probabilistic maximal covering location-allocation problem, Aggregation error for location models: Survey and analysis, Facility location and supply chain management. A review, The variable radius covering problem, Location with acceleration-deceleration distance, Combinatorial optimization in system configuration design, A flexible model and efficient solution strategies for discrete location problems, A new model for maximal coverage exploiting GIS capabilities, Worst-case analysis of demand point aggregation for the Euclidean \(p\)-median problem, Robust placement of sensors in dynamic water distribution systems, 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, Location of service facilities for the elderly, Metaheuristic applications on discrete facility location problems: a survey, Strategic route extension in transit networks
Uses Software
