The following pages link to The discrete p-dispersion problem (Q915643):
Displaying 50 items.
- The disruptive anti-covering location problem (Q320083) (← links)
- An integer programming approach for solving the \(p\)-dispersion problem (Q323154) (← links)
- Generalized route planning model for hazardous material transportation with VaR and equity considerations (Q336917) (← links)
- Maxminmin \(p\)-dispersion problem: a variable neighborhood search approach (Q337222) (← links)
- \(p\)-median and \(p\)-dispersion problems: a bi-criteria analysis (Q337587) (← links)
- Computational results of a semidefinite branch-and-bound algorithm for \(k\)-cluster (Q342176) (← links)
- Subset selection from large datasets for kriging modeling (Q381304) (← links)
- Heuristic solution approaches for the maximum minsum dispersion problem (Q513174) (← links)
- The discrete multidimensional MPUM (Q607381) (← links)
- A simple and effective algorithm for the MaxMin diversity problem (Q646655) (← links)
- A multiobjective model for locating undesirable facilities (Q689245) (← links)
- Good solutions to discrete noxious location problems via metaheuristics (Q689250) (← links)
- Discrete location problems with push-pull objectives (Q697575) (← links)
- Multiobjective optimization for multimode transportation problems (Q721075) (← links)
- Construction and improvement algorithms for dispersion problems (Q726217) (← links)
- Approximate solutions of continuous dispersion problems (Q816409) (← links)
- Finding minimum and equitable risk routes for hazmat shipments (Q856784) (← links)
- A tabu search approach for scheduling hazmat shipments (Q856786) (← links)
- A branch-and-cut method for the obnoxious \(p\)-median problem (Q926563) (← links)
- Solving circle packing problems by global optimization: numerical results and industrial applications (Q932199) (← links)
- A heuristic approach for the max-min diversity problem based on max-clique (Q1010298) (← links)
- The equitable dispersion problem (Q1011261) (← links)
- Variable neighborhood search for the heaviest \(k\)-subgraph (Q1025229) (← links)
- Heuristics for the bi-objective path dissimilarity problem (Q1025234) (← links)
- GRASP and path relinking for the max-min diversity problem (Q1038285) (← links)
- On the set partitioning type formulation for the discrete location problem (Q1088881) (← links)
- Analytical models for locating undesirable facilities (Q1118522) (← links)
- Integer-friendly formulations for the \(r\)-separation problem (Q1268268) (← links)
- Some personal views on the current state and the future of locational analysis (Q1291654) (← links)
- A comparison of \(p\)-dispersion heuristics (Q1342949) (← 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)
- Simulated annealing based GRASP for Pareto-optimal dissimilar paths problem (Q1701982) (← links)
- Dispersing points on intervals (Q1706121) (← links)
- On linearization techniques for budget-constrained binary quadratic programming problems (Q1709935) (← links)
- MILP models for the selection of a small set of well-distributed points (Q1727947) (← links)
- An exact algorithm for designing optimal districts in the collection of waste electric and electronic equipment through an improved reformulation (Q1728503) (← links)
- Effective metaheuristic algorithms for the minimum differential dispersion problem (Q1751715) (← links)
- A new compact formulation for the discrete \(p\)-dispersion problem (Q1752169) (← links)
- Solving the maximum min-sum dispersion by alternating formulations of two different problems (Q1753455) (← links)
- Fast approximation algorithms for \(p\)-centers in large \(\delta\)-hyperbolic graphs (Q1799228) (← links)
- The discrete p-maxian location problem (Q1824542) (← links)
- Solving \(k\)-cluster problems to optimality with semidefinite programming (Q1925793) (← links)
- A linear time approximation scheme for computing geometric maximum \(k\)-star (Q1942028) (← links)
- On finding dissimilar paths (Q1969851) (← links)
- A hybrid heuristic for the maximum dispersion problem (Q2028755) (← links)
- The conditional \(p\)-dispersion problem (Q2046325) (← 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)
- On the discrete Fuglede and Pompeiu problems (Q2174117) (← links)
