Network and Discrete Location: Models, Algorithms, and Applications, Second Edition

From MaRDI portal
Publication:2847898

DOI10.1002/9781118537015zbMath1276.90038OpenAlexW2498486790MaRDI QIDQ2847898

Mark S. Daskin

Publication date: 12 September 2013

Full work available at URL: https://doi.org/10.1002/9781118537015




Related Items (32)

Capacitated refueling station location problem with traffic deviations over multiple time periodsOptimal algorithms for some inverse uncapacitated facility location problems on networksLocation-based techniques for the synergy approximation in combinatorial transportation auctionsTerritorial design optimization for business sales planStrengthening the reliability fixed-charge location model using clique constraintsA survey of healthcare facility locationThe cardinality constrained inverse center location problems on tree networks with edge length augmentationA matheuristic for solving the bilevel approach of the facility location problem with cardinality constraints and preferencesLocation and two-echelon inventory network design with economies and diseconomies of scale in facility operating costsA scaleable projection-based branch-and-cut algorithm for the \(p\)-center problemA vertex weighting-based double-tabu search algorithm for the classical \(p\)-center problemAn extreme‐point tabu‐search algorithm for fixed‐charge network problemsOn seeking efficient Pareto optimal points in multi-player minimum cost flow problems with application to transportation systemsRobust facility location in reverse logisticsService center location problems with decision dependent utilities and a pandemic case studyEfficient presolving methods for solving maximal covering and partial set covering location problemsExact solution approaches for the discrete α‐neighbor p‐center problemOptimal algorithms for inverse obnoxious center location problems under the weighted Chebyshev and Hamming cost norms on networksThe complete vertex \(p\)-center problemAn integrated supply chain problem: a nested Lagrangian relaxation approachClassical and inverse median location problems under uncertain environmentA two-stage robust model for a reliable \(p\)-center facility location problemVariants of the \(\varepsilon\)-constraint method for biobjective integer programming problems: application to \(p\)-median-cover problemsThe Effect of Environmental Criteria on Locating a Biorefinery: A Green Facility Location ProblemAxiomatic characterization of the center function. The case of non-universal axiomsAn approximation algorithm for a competitive facility location problem with network effectsAn exact solution framework for the multiple gradual cover location problemUnnamed ItemLocation and capacity design of congested intermediate facilities in networksUnnamed ItemA SOLUTION ALGORITHM FOR p-MEDIAN LOCATION PROBLEM ON UNCERTAIN RANDOM NETWORKSMarket proliferation and the impact of locational complexity on network restructuring


Uses Software



This page was built for publication: Network and Discrete Location: Models, Algorithms, and Applications, Second Edition