Pages that link to "Item:Q1266569"

The following pages link to A Lagrangean heuristic for the maximal covering location problem (Q1266569):

Displaying 33 items.

• A hybrid method for the probabilistic maximal covering location-allocation problem (Q337483) (← links)
• Local search heuristics for the mobile facility location problem (Q337654) (← links)
• A decomposition heuristic for the maximal covering location problem (Q606191) (← links)
• Facility location models for distribution system design (Q707128) (← links)
• A branch-and-cut method for the obnoxious \(p\)-median problem (Q926563) (← links)
• The heuristic concentration-integer and its application to a class of location problems (Q960388) (← links)
• A decomposition approach for the probabilistic maximal covering location-allocation problem (Q1017444) (← links)
• A new model for maximal coverage exploiting GIS capabilities (Q1039775) (← links)
• Resource-constrained management of heterogeneous assets with stochastic deterioration (Q1042122) (← links)
• Lagrangean duals and exact solution to the capacitated \(p\)-center problem (Q1044136) (← links)
• A multi-objective model for locating fire stations (Q1303572) (← links)
• A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem (Q1577777) (← links)
• A hierarchical model for the location of perinatal facilities in the municipality of Rio de Janeiro (Q1600932) (← links)
• A VNS-LP algorithm for the robust dynamic maximal covering location problem (Q1642060) (← links)
• Intelligent-guided adaptive search for the maximum covering location problem (Q1652063) (← links)
• A Lagrangian search method for the \(P\)-median problem (Q1675643) (← links)
• Novel formulations and VNS-based heuristics for single and multiple allocation \(p\)-hub maximal covering problems (Q1698283) (← links)
• Benders decomposition for very large scale partial set covering and maximal covering location problems (Q1719620) (← links)
• On the overlap area of a disk and a piecewise circular domain (Q1725599) (← links)
• Dual-based heuristics for a hierarchical covering location problem (Q1869894) (← links)
• A maximal covering location model in the presence of partial coverage (Q1881656) (← links)
• Towards unified formulations and extensions of two classical probabilistic location models (Q1886724) (← links)
• Covering models and optimization techniques for emergency response facility location and planning: a review (Q1935907) (← links)
• Recent optimization models and trends in location, relocation, and dispatching of emergency medical vehicles (Q1991100) (← links)
• A dual bounding scheme for a territory design problem (Q2257364) (← links)
• Determining optimal police patrol areas with maximal covering and backup covering location models (Q2379709) (← links)
• Solving the maximal covering location problem with heuristic concentration (Q2384889) (← links)
• A multiple server location-allocation model for service system design (Q2468482) (← links)
• Load balancing and capacity constraints in a hierarchical location model (Q2490178) (← links)
• Practical aspects associated with location planning for maternal and perinatal assistance in Brazil (Q2507372) (← links)
• Déploiement et Redéploiement des Véhicules Ambulanciers dans la Gestion d'un Service Préhospitalier d'Urgence (Q6102740) (← links)
• Optimizing emergency services for road safety using a decomposition method: a case study of Delhi (Q6105937) (← links)
• Efficient presolving methods for solving maximal covering and partial set covering location problems (Q6168589) (← links)