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

DOI10.1002/9781118537015zbMath1276.90038MaRDI QIDQ2847898

Publication date: 12 September 2013

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

90C10: Integer programming

90-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming

90B80: Discrete location and assignment

Related Items

Unnamed Item, Unnamed Item, A SOLUTION ALGORITHM FOR p-MEDIAN LOCATION PROBLEM ON UNCERTAIN RANDOM NETWORKS, Optimal algorithms for some inverse uncapacitated facility location problems on networks, The Effect of Environmental Criteria on Locating a Biorefinery: A Green Facility Location Problem, A vertex weighting-based double-tabu search algorithm for the classical \(p\)-center problem, Robust facility location in reverse logistics, Efficient presolving methods for solving maximal covering and partial set covering location problems, Strengthening the reliability fixed-charge location model using clique constraints, An integrated supply chain problem: a nested Lagrangian relaxation approach, Location and capacity design of congested intermediate facilities in networks, Territorial design optimization for business sales plan, A survey of healthcare facility location, Variants of the \(\varepsilon\)-constraint method for biobjective integer programming problems: application to \(p\)-median-cover problems, Axiomatic characterization of the center function. The case of non-universal axioms, An approximation algorithm for a competitive facility location problem with network effects, Classical and inverse median location problems under uncertain environment, A two-stage robust model for a reliable \(p\)-center facility location problem, An exact solution framework for the multiple gradual cover location problem, Market proliferation and the impact of locational complexity on network restructuring, The complete vertex \(p\)-center problem, Capacitated refueling station location problem with traffic deviations over multiple time periods, On seeking efficient Pareto optimal points in multi-player minimum cost flow problems with application to transportation systems, Location-based techniques for the synergy approximation in combinatorial transportation auctions, The cardinality constrained inverse center location problems on tree networks with edge length augmentation, A matheuristic for solving the bilevel approach of the facility location problem with cardinality constraints and preferences, Location and two-echelon inventory network design with economies and diseconomies of scale in facility operating costs, A scaleable projection-based branch-and-cut algorithm for the \(p\)-center problem

Uses Software