Pages that link to "Item:Q3216395"

The following pages link to An Analysis of Network Location Problems with Distance Constraints (Q3216395):

Displaying 50 items.

• The disruptive anti-covering location problem (Q320083) (← links)
• An integer programming approach for solving the \(p\)-dispersion problem (Q323154) (← links)
• A distribution network design problem in the automotive industry: MIP formulation and heuristics (Q337173) (← links)
• An efficient algorithm to solve the conditional covering problem on trapezoid graphs (Q410643) (← links)
• An iterated local search for the budget constrained generalized maximal covering location problem (Q483216) (← links)
• On conditional covering problem (Q626967) (← links)
• On worst-case aggregation analysis for network location problems (Q689246) (← links)
• Efficient algorithms for the conditional covering problem (Q690494) (← links)
• Discrete location problems with push-pull objectives (Q697575) (← links)
• The zone-constrained location problem on a network (Q809885) (← links)
• The discrete p-dispersion problem (Q915643) (← links)
• A branch-and-cut method for the obnoxious \(p\)-median problem (Q926563) (← links)
• The equitable dispersion problem (Q1011261) (← links)
• Conditional covering: greedy heuristics and computational results (Q1091265) (← links)
• On eliminating vertices from a tree (Q1100082) (← links)
• Axiomatic considerations in multi-objective location theory (Q1107412) (← links)
• Analytical models for locating undesirable facilities (Q1118522) (← links)
• Integer-friendly formulations for the \(r\)-separation problem (Q1268268) (← links)
• Locating flow-capturing units on a network with multi-counting and diminishing returns to scale (Q1278239) (← links)
• A review of extensive facility location in networks (Q1278421) (← links)
• Facets for node packing (Q1278997) (← links)
• The obnoxious \(p\) facility network location problem with facility interaction (Q1291604) (← links)
• The dynamics and internal geometry of the three-city noxious location problem (Q1310194) (← links)
• Solving the anti-covering location problem using Lagrangian relaxation (Q1373891) (← links)
• Effective methods for solving the bi-criteria \(p\)-center and \(p\)-dispersion problem (Q1628040) (← links)
• Median and covering location problems with interconnected facilities (Q1738812) (← links)
• Location analysis: a synthesis and survey (Q1776950) (← links)
• The discrete p-maxian location problem (Q1824542) (← links)
• Facility location on a tree with maximum distance constraints (Q1919972) (← links)
• Isodistant points in competitive network facility location (Q1939096) (← links)
• A linear time approximation scheme for computing geometric maximum \(k\)-star (Q1942028) (← links)
• The conditional covering problem on unweighted interval graphs with nonuniform coverage radius (Q1948610) (← links)
• A support tool for planning classrooms considering social distancing between students (Q2065002) (← links)
• Repulsion-based p-dispersion with distance constraints in non-convex polygons (Q2070713) (← links)
• Worst-case analysis of clique MIPs (Q2089781) (← links)
• Optimization in business strategy as a part of sustainable economic growth using clique covering of fuzzy graphs (Q2098337) (← links)
• Covering problem on fuzzy graphs and its application in disaster management system (Q2157042) (← links)
• Safe distancing in the time of COVID-19 (Q2171551) (← links)
• Alternative formulations for the obnoxious \(p\)-median problem (Q2217491) (← links)
• Facility location with tree topology and radial distance constraints (Q2280295) (← links)
• The minimum weighted covering location problem with distance constraints (Q2384883) (← links)
• Column generation approach for the point-feature cartographic label placement problem (Q2427437) (← links)
• Lagrangean relaxation with clusters for point-feature cartographic label placement problems (Q2468473) (← links)
• Single- and multi-objective defensive location problems on a network (Q2469584) (← links)
• Public facility location using dispersion, population, and equity criteria (Q2514787) (← links)
• On the unified dispersion problem: efficient formulations and exact algorithms (Q2629707) (← links)
• Review of obnoxious facilities location problems (Q2669654) (← links)
• A review on discrete diversity and dispersion maximization from an OR perspective (Q2670513) (← links)
• Comments on ‘Facility location problem on network under multiple criteria fuzzy set theoretic approach’ (Q3494374) (← links)
• The Solution of Distance Constrained Mini-Sum Location Problems (Q3686392) (← links)