All Stories

  1. Maximum capture location problem with random utilities and overflow penalties
  2. A mixed-integer optimization formulation for buyer formation
  3. Novel valid inequalities and branch-and-price for Stackelberg security games
  4. Fifty Years of Location Theory - A Selective Review
  5. Playing Stackelberg Security Games in perfect formulations
  6. The follower competitive facility location problem under the nested logit choice rule
  7. Store location with multipurpose shopping trips and a new random utility customers’ choice model
  8. Vehicle routing for milk collection with gradual blending: A case arising in Chile
  9. The leader multipurpose shopping location problem
  10. Perspectives on modeling hub location problems
  11. Maximizing political vote in multiple districts
  12. Stability of utility functions and apportionment rules in location models
  13. A multi-product maximin hazmat routing-location problem with multiple origin-destination pairs
  14. The Follower Competitive Location Problem with Comparison-Shopping
  15. Systematically Incorporating Environmental Objectives into Shale Gas Pipeline Development: A Binary Integer, Multiobjective Spatial Optimization Model
  16. A single allocation p-hub median problem with general piecewise-linear costs in arcs
  17. Effects of multipurpose shopping trips on retail store location in a duopoly
  18. On the effect of inventory policies on distribution network design with several demand classes
  19. Corridor-based metro network design with travel flow capture
  20. The milk collection problem with blending and collection points
  21. Multi-objective rapid transit network design with modal competition: The case of Concepción, Chile
  22. Asymmetries in Competitive Location Models on the Line
  23. Hazardous materials collection with multiple-product loading
  24. A milk collection problem with blending
  25. The maxisum and maximin-maxisum HAZMAT routing problems
  26. Scheduling operating rooms with consideration of all resources, post anesthesia beds and emergency surgeries
  27. Joint location-inventory problem with differentiated service levels using critical level policy
  28. Location modeling for municipal solid waste facilities
  29. A reconfiguration of fire station and fleet locations for the Santiago Fire Department
  30. Implications of dynamic spectrum management for regulation
  31. Locating fixed roadside units in a bus transport network for maximum communications probability
  32. The maximin HAZMAT routing problem
  33. Competitive Location Models
  34. P-Cable Trench Problem with Covering
  35. Maximizing the minimum cover probability by emergency facilities
  36. On agglomeration in competitive location models
  37. A bi-objective model for the location of landfills for municipal solid waste
  38. Multicriteria decision making under uncertainty: a visual approach
  39. Rapid transit network design for optimal cost and origin–destination demand capture
  40. A competitive hub location and pricing problem
  41. p-Hub approach for the optimal park-and-ride facility location problem
  42. Location Analysis
  43. A branch-and-cluster coordination scheme for selecting prison facility sites under uncertainty
  44. Transmitter location for maximum coverage and constructive–destructive interference management
  45. Optimizing location and size of rural schools in Chile
  46. Lagrangean relaxation heuristics for the p-cable-trench problem
  47. Mobile phone tower location for survival after natural disasters
  48. Location of Multiple-Server Common Service Centers or Facilities, for Minimizing General Congestion and Travel Cost Functions
  49. Foundations of Location Analysis
  50. Median Problems in Networks
  51. Lagrangean Relaxation-Based Techniques for Solving Facility Location Problems
  52. Pioneering Developments in Location Analysis
  53. A branch-and-price algorithm for the Vehicle Routing Problem with Deliveries, Selective Pickups and Time Windows
  54. Determination of Feeder Areas for the Design of Large Distribution Networks
  55. Location of single-server immobile facilities subject to a loss constraint
  56. Minimum cost path location for maximum traffic capture
  57. A branch and cut algorithm for the hierarchical network design problem
  58. A conditional p-hub location problem with attraction functions
  59. A single vehicle routing problem with fixed delivery and optional collections
  60. Optimal Capacity Expansion in Electric Power Subtransmission Networks
  61. Gradual location set covering with service quality
  62. Optimal location of multi-server congestible facilities operating as M/Er/m/N queues
  63. The heuristic concentration-integer and its application to a class of location problems
  64. Median Problems in Networks
  65. Workload assignment with training, hiring and firing
  66. Facility location for market capture when users rank facilities by shorter travel and waiting times
  67. Optimal design of hierarchical networks with free main path extremes
  68. Employee positioning and workload allocation
  69. Selecting compact habitat reserves for species with differential habitat size needs
  70. Locating Cell Phone Towers in a Rural Environment
  71. An optimal procedure for solving the hierarchical network design problem
  72. ALLOCATING SERVERS TO FACILITIES, WHEN DEMAND IS ELASTIC TO TRAVEL AND WAITING TIMES
  73. Teachers' support with ad-hoc collaborative networks
  74. Multiple path routing algorithm for IP networks
  75. A procedure for the strategic planning of locations, capacities and districting of jails: application to Chile
  76. A PROBABILISTIC FIRE-PROTECTION SITING MODEL WITH JOINT VEHICLE RELIABILITY REQUIREMENTS
  77. Design of Heterogeneous Traffic Networks Using Simulated Annealing Algorithms
  78. Trading off Species Protection and Timber Production in Forests Managed for Multiple Objectives
  79. Finding locations for public service centres that compete with private centres: Effects of congestion
  80. Finding locations for public service centres that compete with private centres: Effects of congestion*
  81. New Trends in Public Facility Location Modeling
  82. Location models for airline hubs behaving as M/D/c queues
  83. Beyond Nintendo: design and assessment of educational video games for first and second grade students
  84. Anticoverage Models for Obnoxious Material Transportation
  85. Location Problems in the Public Sector
  86. Hierarchical location–allocation models for congested systems
  87. Optimal location of public health centres which provide free and paid services
  88. Optimal location of public health centres which provide free and paid services
  89. Survivable Capacitated Network Design Problem: New Formulation and Lagrangean Relaxation
  90. Survivable capacitated network design problem: new formulation and Lagrangean relaxation
  91. Location of hubs in a competitive environment
  92. Probabilistic, Maximal Covering Location—Allocation Models forCongested Systems
  93. The p-median problem in a changing network: the case of Barcelona
  94. Linear, Non-Approximated Models for Optimal Routing in Hazardous Environments
  95. Linear, non-approximated models for optimal routing in hazardous environments
  96. Linear, non-approximated models for optimal routing in hazardous environments
  97. The Queueing Maximal availability location problem: A model for the siting of emergency vehicles
  98. Siting Emergency Services
  99. The queuing probabilistic location set covering problem and some extensions
  100. The capacitated standard response fire protection siting problem: Deterministic and probabilistic models
  101. The maximum-capture hierarchical location problem
  102. A probabilistic fire-protection siting model with joint vehicle reliability requirements
  103. A probabilistic FLEET model with individual vehicle reliability requirements
  104. Preface
  105. Hierarchical Location-Allocation Models for Congested Systems
  106. Location Models for Airline Hubs Behaving as M/D/c Queues
  107. Location of Multiple Server Common Service Centers or Public Facilities for Minimizing General Congestion and Travel Cost Functions
  108. PoQBA: A New Path Admission Control for Diffserv Networks