MENU-OKF

MaRDI QIDQ19533swMATHFDO

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

Cited in

(only showing first 100 items - show all)

• Uncapacitated single and multiple allocation \(p\)-hub center problems
• 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
• Worst-case analysis of demand point aggregation for the Euclidean p-median problem
• Robust placement of sensors in dynamic water distribution systems
• Inverse 1-center location problems with edge length augmentation on trees
• The design of robust value-creating supply chain networks: a critical review
• K-center and K-median problems in graded distances
• A dynamic programming heuristic for the \(P\)-median problem
• Microlay
• TSPLIB
• Location and layout planning. A survey
• Locating service facilities whose reliability is distance dependent.
• Product warranty logistics: issues and challenges.
• The obnoxious center problem on weighted cactus graphs.
• RAMP
• GASUB
• Application of decision analysis techniques to the Weber facility location problem
• Effective methods for solving the bi-criteria \(p\)-center and \(p\)-dispersion problem
• The planar multifacility collection depots location problem
• OR-Library
• A scalable exact algorithm for the vertex \(p\)-center problem
• Territorial design optimization for business sales plan
• A VNS-LP algorithm for the robust dynamic maximal covering location problem
• 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
• A survey of healthcare facility location
• Integer programming formulations for three sequential discrete competitive location problems with foresight
• The probabilistic \(p\)-center problem: planning service for potential customers
• A multi-objective facility location problem in the presence of variable gradual coverage performance and cooperative cover
• Supply chain network design under uncertainty: a comprehensive review and future research directions
• ArcView
• Recovery strategies from major supply disruptions in single and multiple sourcing networks
• Solving the bilevel facility location problem under preferences by a Stackelberg-evolutionary algorithm
• Lagrangian relaxation for an inventory location problem with periodic inventory control and stochastic capacity constraints
• k-balanced center location problem: a new multi-objective facility location problem
• DDSIP
• On the overlap area of a disk and a piecewise circular domain
• Inverse quickest center location problem on a tree
• Variants of the \(\varepsilon\)-constraint method for biobjective integer programming problems: application to \(p\)-median-cover problems
• A heuristic algorithm for solving large location-inventory problems with demand uncertainty
• Integrated location-inventory modelling under forward and reverse product flows in the used merchandise retail sector: a multi-echelon formulation
• Axiomatic characterization of the center function. The case of non-universal axioms
• An approximation algorithm for a competitive facility location problem with network effects
• 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 computational study of a nonlinear minsum facility location problem
• Location analysis: a synthesis and survey
• Strategic facility location: A review
• Dominant, an algorithm for the \(p\)-center problem.
• Inventory, transportation, service quality and the location of distribution centers
• Network distance characteristics that affect computational effort in \(p\)-median location problems
• Obnoxious-facility location and data-envelopment analysis: a combined distance-based formula\-tion
• Solving the multiple competitive facilities location problem
• Selecting hierarchical facilities in a service-operations environment
• A maximal covering location model in the presence of partial coverage
• Implementing a mathematical model for locating EMS vehicles in Fayetteville, NC
• 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
• Does Euclidean distance work well when the \(p\)-median model is applied in rural areas?
• SITATION
• MOD-DIST
• Designing a supply chain network under the risk of disruptions
• Design of a multiobjective reverse logistics network considering the cost and service level
• ConsNet -- a tabu search approach to the spatially coherent conservation area network design problem
• Classical and inverse median location problems under uncertain environment
• BEAMR
• A two-stage robust model for a reliable p-center facility location problem
• A robust counterpart approach to the bi-objective emergency medical service design problem
• An exact solution framework for the multiple gradual cover location problem
• The stratified p-center problem
• Maximizing expected coverage of flow and opportunity for diversion in networked systems
• Resource allocation for contingency planning: an inexact proximal bundle method for stochastic optimization
• Tabu search
• An elliptical cover problem in drone delivery network design and its solution algorithms
• 2-approximation algorithm for minmax absolute maximum lateness scheduling-location problem
• Exploiting flat subspaces in local search for \(p\)-center problem and two fault-tolerant variants
• Resource distribution under spatiotemporal uncertainty of disease spread: stochastic versus robust approaches
• Market proliferation and the impact of locational complexity on network restructuring
• Solving the absolute 1-center problem in the quickest path case
• The effect of optimizing warehouse locations on omnichannel designs
• Optimizing multiple qualifications of products on non-identical parallel machines
• 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
• A stochastic programming model with endogenous and exogenous uncertainty for reliable network design under random disruption
• A robust \(p\)-center problem under pressure to locate shelters in wildfire context
• A distributionally robust optimization approach for two-stage facility location problems
• Computation of inverse 1-center location problem on the weighted trapezoid graphs
• The complete vertex \(p\)-center problem
• RAMP algorithms for the capacitated facility location problem
• The obnoxious facilities planar \(p\)-median problem

This page was built for software: MENU-OKF