MENU-OKF

swMATH7505MaRDI QIDQ19533FDOQ19533

Author name not available (Why is that?)

Official website: http://sitemaker.umich.edu/msdaskin/network_and_discrete_location

Cited In (only showing first 100 items - show all)

• A note on the nestedness property for ordered median problems in tree networks
• An exact solution framework for the multiple gradual cover location problem
• Location of alternative-fuel stations using the flow-refueling location model and dispersion of candidate sites on arcs
• Modeling data envelopment analysis (DEA) efficient location/allocation decisions
• Distribution network design for fixed lifetime perishable products: a model and solution approach
• Location of service facilities for the elderly
• Alternate risk measures for emergency medical service system design
• Pharmacy duty scheduling problem
• Optimal algorithms for selective variants of the classical and inverse median location problems on trees
• Network and discrete location. Models, algorithms, and applications
• The continuous \(p\)-centre problem: an investigation into variable neighbourhood search with memory
• Capacitated warehouse location model with risk pooling
• A two-echelon inventory-location problem with service considerations
• Location of Emergency Facilities with Uncertainty in the Demands
• A note on duality gap in the simple plant location problem
• Strategic design of distribution systems with economies of scale in transportation
• Min-Sup-Min Robust Combinatorial Optimization with Few Recourse Solutions
• A multi-stage facility location problem with staircase costs and splitting of commodities: model, heuristic approach and application
• Comparative error bound theory for three location models: continuous demand versus discrete demand
• A multi-criteria decision making approach for location planning for urban distribution centers under uncertainty
• A multi-objective model for locating search and rescue boats
• Location modeling for municipal solid waste facilities
• Location and layout planning. A survey
• On the circle closest to a set of points
• Multi-facility ordered median problems in directed networks
• Robust vertex \(p\)-center model for locating urgent relief distribution centers
• A hybrid method for the probabilistic maximal covering location-allocation problem
• \(p\)-median and \(p\)-dispersion problems: a bi-criteria analysis
• Bee colony optimization for the \(p\)-center problem
• The obnoxious center problem on weighted cactus graphs.
• The connected \(p\)-center problem on block graphs with forbidden vertices
• The \(p\)-facility ordered median problem on networks
• A column generation approach for the maximal covering location problem
• Location-allocation models for traffic police patrol vehicles on an interurban network
• Optimal shrinking of the distribution chain: the facilities delocation decision
• A profit-maximizing supply chain network design model with demand choice flexibility
• An exact procedure and LP formulations for the leader-follower location problem
• Applying ranking and selection procedures to long-term mitigation for improved network restoration
• Location coverage models with demand originating from nodes and paths: Application to cellular network design
• Multiple voting location problems
• Finding a cluster of points and the grey pattern quadratic assignment problem
• Uncapacitated single and multiple allocation \(p\)-hub center problems
• Aggregation error for location models: Survey and analysis
• A flexible model and efficient solution strategies for discrete location problems
• Location and capacity design of congested intermediate facilities in networks
• Demand point aggregation for planar covering location models
• Enhancements to two exact algorithms for solving the vertex \(P\)-center problem
• Strategic route extension in transit networks
• The \(K\)-connection location problem in a plane
• Application of decision analysis techniques to the Weber facility location problem
• The capacity and distance constrained plant location problem
• New relaxation-based algorithms for the optimal solution of the continuous and discrete \(p\)-center problems
• A decomposition approach for the probabilistic maximal covering location-allocation problem
• Location with acceleration-deceleration distance
• Worst-case analysis of demand point aggregation for the Euclidean \(p\)-median problem
• Static and dynamic source locations in undirected networks
• The variable radius covering problem
• A mixed integer linear program and tabu search approach for the complementary edge covering problem
• Threshold robustness in discrete facility location problems: a bi-objective approach
• An effective heuristic for the \(P\)-median problem with application to ambulance location
• Effective methods for solving the bi-criteria \(p\)-center and \(p\)-dispersion problem
• Some heuristic methods for solving \(p\)-median problems with a coverage constraint
• ConsNet -- a tabu search approach to the spatially coherent conservation area network design problem
• Lagrangian relaxation for an inventory location problem with periodic inventory control and stochastic capacity constraints
• A parallelized lagrangean relaxation approach for the discrete ordered median problem
• Maximizing the minimum cover probability by emergency facilities
• A heuristic algorithm for solving large location-inventory problems with demand uncertainty
• A computational study of a nonlinear minsum facility location problem
• The directional \(p\)-median problem: definition, complexity, and algorithms
• Obnoxious-facility location and data-envelopment analysis: a combined distance-based formula\-tion
• A continuous approximation approach for the integrated facility-inventory allocation problem
• A decision support model for staff allocation of mobile medical service
• A modified variable neighborhood search for the discrete ordered median problem
• A dynamic programming heuristic for the \(P\)-median problem
• Dynamic supply chain design with inventory
• Effectiveness-equity models for facility location problems on tree networks
• Optimality conditions for distributive justice
• Title not available (Why is that?)
• Metaheuristic applications on discrete facility location problems: a survey
• A Voronoi-based heuristic algorithm for locating distribution centers in disasters
• A model for locating park-and-ride facilities on urban networks based on maximizing flow capture: a case study of Isfahan, Iran
• Optimizing budget allocation for center and median points
• GASUB: finding global optima to discrete location problems by a genetic-like algorithm
• What you should know about location modeling
• The α-reliable mean-excess regret model for stochastic facility location modeling
• A hybrid clonal selection algorithm for the location routing problem with stochastic demands
• Designing robust coverage networks to hedge against worst-case facility losses
• An improved Lagrangian relaxation-based heuristic for a joint location-inventory problem
• A dynamic logistics coordination model for evacuation and support in disaster response activities
• Facility location models for distribution system design
• An integrated supply chain problem: a nested Lagrangian relaxation approach
• On the use of genetic algorithms to solve location problems
• Designing two-echelon supply networks
• On statistical bounds of heuristic solutions to location problems
• The stochastic location model with risk pooling
• Using clustering analysis in a capacitated location-routing problem
• A scatter search-based heuristic to locate capacitated transshipment points
• A genetic algorithm for a single product network design model with lead time and safety stock considerations
• Facility location and supply chain management. A review
• Bi-level programming model and hybrid genetic algorithm for flow interception problem with customer choice

This page was built for software: MENU-OKF