A bibliography for some fundamental problem categories in discrete location science

From MaRDI portal
Publication:2384836

DOI10.1016/j.ejor.2006.12.044zbMath1141.90025OpenAlexW2024133475MaRDI QIDQ2384836

H. A. Eiselt, Mark S. Daskin, Charles S. Re Velle

Publication date: 10 October 2007

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2006.12.044



Related Items

A bi-objective approach to discrete cost-bottleneck location problems, Heuristic algorithms for solving an integrated dynamic center facility location -- network design model, Novel dual discounting functions for the Internet shopping optimization problem: new algorithms, Integrated strategic and tactical supply chain planning with price-sensitive demands, Exact and heuristic approaches to solve the Internet shopping optimization problem with delivery costs, Optimizing location of manufacturing industries in the context of economic globalization: a bi-level model based approach, Variable neighborhood search for the pharmacy duty scheduling problem, A distribution network design problem in the automotive industry: MIP formulation and heuristics, Tactical network planning for food aid distribution in Kenya, Strengthening the reliability fixed-charge location model using clique constraints, New heuristic algorithms for discrete competitive location problems with binary and partially binary customer behavior, A survey of healthcare facility location, A decomposition approach for the \(p\)-median problem on disconnected graphs, A mixed integer nonlinear programming model and heuristic solutions for location, inventory and pricing decisions in a closed loop supply chain, The multimode covering location problem, Stability and fairness in models with a multiple membership, A matheuristic for solving the bilevel approach of the facility location problem with cardinality constraints and preferences, Linear upper-bound unavailability set covering models for locating ambulances: application to Tehran rural roads, The design of a reliable and robust hierarchical health service network using an accelerated Benders decomposition algorithm, A discrete competitive facility location model with proportional and binary rules sequentially applied, Approximability results for the $p$-centdian and the converse centdian problems, Designing e‐commerce supply chains: a stochastic facility–location approach, Improving emergency services efficiency during Islamic pilgrimage through optimal allocation of facilities, A capacitated biobjective location problem with uniformly distributed demands in the UAV‐supported delivery operation, New variants of the simple plant location problem and applications, Approximability results for the converse connectedp-centre problem, Estimating the Pareto Front of a Hard Bi-criterion Competitive Facility Location Problem, Supply chain network design under uncertainty: a comprehensive review and future research directions, Lagrangian Heuristics for Large-Scale Dynamic Facility Location with Generalized Modular Capacities, The connected \(p\)-center problem on block graphs with forbidden vertices, Complexity evaluation of benchmark instances for the \(p\)-median problem, Sequential competitive location on networks, A continuum perspective of customer choice rules for competitive facility location problems, Internet shopping with price sensitive discounts, Exact and heuristic solutions of a discrete competitive location model with Pareto-Huff customer choice rule, A variable neighborhood search heuristic for the design of multicommodity production-distribution networks with alternative facility configurations, The design of robust value-creating supply chain networks, Optimization of competitive facility location for chain stores, Robust model for discrete competitive facility location problem with the uncertainty of customer behaviors, Data aggregation for \(p\)-median problems, A practical heuristic for maximum coverage in large-scale continuous location problem, Genetic algorithm for obstacle location-allocation problems with customer priorities, A bi-level stochastic optimization model for reliable supply chain in competitive environments: hybridizing exact method and genetic algorithm, Optimizing source and receiver placement in multistatic sonar networks to monitor fixed targets, Berge-acyclic multilinear 0-1 optimization problems, Improving solution of discrete competitive facility location problems, A congested capacitated multi-level fuzzy facility location problem: an efficient drone delivery system, A hierarchical solution approach for a multicommodity distribution problem under a special cost structure, Two-echelon, multi-commodity supply chain network design with mode selection, lead-times and inventory costs, Simple dynamic location problem with uncertainty: a primal-dual heuristic approach, Hybrid biobjective evolutionary algorithms for the design of a hospital waste management network, Heuristics for the dynamic facility location problem with modular capacities, MapReduce based location selection algorithm for utility maximization with capacity constraints, A facility location and installation of resources model for level of repair analysis, Pharmacy duty scheduling problem, Modeling and solving a logging camp location problem, Optimally computing all solutions of Stackelberg with parametric prices and of general monotonous gain functions on a tree, Facility location and supply chain management. A review, Queueing maximal covering location-allocation problem: an extension with \textit{M/G/1} queueing systems, Optimal algorithms for selective variants of the classical and inverse median location problems on trees, Risk-balanced territory design optimization for a micro finance institution, 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, PARALLEL OPTIMIZATION ALGORITHM FOR COMPETITIVE FACILITY LOCATION, Optimizing location and size of rural schools in Chile, An efficient hybrid particle swarm optimization algorithm for solving the uncapacitated continuous location-allocation problem


Uses Software


Cites Work