All Stories

  1. Location modeling for municipal solid waste facilities
  2. Implications of dynamic spectrum management for regulation
  3. Locating fixed roadside units in a bus transport network for maximum communications probability
  4. The maximin HAZMAT routing problem
  5. Competitive Location Models
  6. Maximizing the minimum cover probability by emergency facilities
  7. On agglomeration in competitive location models
  8. A bi-objective model for the location of landfills for municipal solid waste
  9. Multicriteria decision making under uncertainty: a visual approach
  10. Rapid transit network design for optimal cost and origin–destination demand capture
  11. A competitive hub location and pricing problem
  12. p-Hub approach for the optimal park-and-ride facility location problem
  13. Location Analysis
  14. A branch-and-cluster coordination scheme for selecting prison facility sites under uncertainty
  15. Transmitter location for maximum coverage and constructive–destructive interference management
  16. Optimizing location and size of rural schools in Chile
  17. Lagrangean relaxation heuristics for the p-cable-trench problem
  18. Mobile phone tower location for survival after natural disasters
  19. Location of Multiple-Server Common Service Centers or Facilities, for Minimizing General Congestion and Travel Cost Functions
  20. Foundations of Location Analysis
  21. Median Problems in Networks
  22. Lagrangean Relaxation-Based Techniques for Solving Facility Location Problems
  23. Pioneering Developments in Location Analysis
  24. A branch-and-price algorithm for the Vehicle Routing Problem with Deliveries, Selective Pickups and Time Windows
  25. Determination of Feeder Areas for the Design of Large Distribution Networks
  26. Location of single-server immobile facilities subject to a loss constraint
  27. Minimum cost path location for maximum traffic capture
  28. A branch and cut algorithm for the hierarchical network design problem
  29. A conditional p-hub location problem with attraction functions
  30. A single vehicle routing problem with fixed delivery and optional collections
  31. Optimal Capacity Expansion in Electric Power Subtransmission Networks
  32. Gradual location set covering with service quality
  33. Optimal location of multi-server congestible facilities operating as M/Er/m/N queues
  34. The heuristic concentration-integer and its application to a class of location problems
  35. Workload assignment with training, hiring and firing
  36. Facility location for market capture when users rank facilities by shorter travel and waiting times
  37. Optimal design of hierarchical networks with free main path extremes
  38. Employee positioning and workload allocation
  39. Selecting compact habitat reserves for species with differential habitat size needs
  40. Locating Cell Phone Towers in a Rural Environment
  41. An optimal procedure for solving the hierarchical network design problem
  42. ALLOCATING SERVERS TO FACILITIES, WHEN DEMAND IS ELASTIC TO TRAVEL AND WAITING TIMES
  43. Teachers' support with ad-hoc collaborative networks
  44. Multiple path routing algorithm for IP networks
  45. A procedure for the strategic planning of locations, capacities and districting of jails: application to Chile
  46. A PROBABILISTIC FIRE-PROTECTION SITING MODEL WITH JOINT VEHICLE RELIABILITY REQUIREMENTS
  47. Design of Heterogeneous Traffic Networks Using Simulated Annealing Algorithms
  48. Trading off Species Protection and Timber Production in Forests Managed for Multiple Objectives
  49. Finding locations for public service centres that compete with private centres: Effects of congestion
  50. Finding locations for public service centres that compete with private centres: Effects of congestion*
  51. Location models for airline hubs behaving as M/D/c queues
  52. Beyond Nintendo: design and assessment of educational video games for first and second grade students
  53. Anticoverage Models for Obnoxious Material Transportation
  54. Location Problems in the Public Sector
  55. Hierarchical location–allocation models for congested systems
  56. Optimal location of public health centres which provide free and paid services
  57. Optimal location of public health centres which provide free and paid services
  58. Survivable Capacitated Network Design Problem: New Formulation and Lagrangean Relaxation
  59. Survivable capacitated network design problem: new formulation and Lagrangean relaxation
  60. Location of hubs in a competitive environment
  61. Probabilistic, Maximal Covering Location—Allocation Models forCongested Systems
  62. The p-median problem in a changing network: the case of Barcelona
  63. Linear, Non-Approximated Models for Optimal Routing in Hazardous Environments
  64. Linear, non-approximated models for optimal routing in hazardous environments
  65. Linear, non-approximated models for optimal routing in hazardous environments
  66. The Queueing Maximal availability location problem: A model for the siting of emergency vehicles
  67. Siting Emergency Services
  68. The queuing probabilistic location set covering problem and some extensions
  69. The capacitated standard response fire protection siting problem: Deterministic and probabilistic models
  70. The maximum-capture hierarchical location problem
  71. A probabilistic fire-protection siting model with joint vehicle reliability requirements
  72. A probabilistic FLEET model with individual vehicle reliability requirements
  73. Median Problems in Networks
  74. New Trends in Public Facility Location Modeling
  75. Hierarchical Location-Allocation Models for Congested Systems
  76. Location Models for Airline Hubs Behaving as M/D/c Queues
  77. Location of Multiple Server Common Service Centers or Public Facilities for Minimizing General Congestion and Travel Cost Functions
  78. PoQBA: A New Path Admission Control for Diffserv Networks