The following pages link to The discrete p-dispersion problem (Q915643):
Displaying 36 items.
- Approximability of the dispersed \(\vec{p}\)-neighbor \(k\)-supplier problem (Q2217474) (← links)
- \(t\)-linearization for the maximum diversity problem (Q2230803) (← links)
- Convex maximization formulation of general sphere packing problem (Q2307930) (← links)
- Space-filling Latin hypercube designs for computer experiments (Q2443402) (← links)
- Facet-defining inequalities for the simple graph partitioning polytope (Q2467133) (← links)
- Polyhedral combinatorics of the cardinality constrained quadratic knapsack problem and the quadratic selective travelling salesman problem (Q2479572) (← links)
- Upper bounds and exact algorithms for \(p\)-dispersion problems (Q2496032) (← links)
- Finding a cluster of points and the grey pattern quadratic assignment problem (Q2507561) (← links)
- Locating two obnoxious facilities using the weighted maximin criterion (Q2583716) (← links)
- On the unified dispersion problem: efficient formulations and exact algorithms (Q2629707) (← links)
- Location of alternative-fuel stations using the flow-refueling location model and dispersion of candidate sites on arcs (Q2642504) (← links)
- Solving the capacitated dispersion problem with variable neighborhood search approaches: from basic to skewed VNS (Q2669792) (← links)
- A review on discrete diversity and dispersion maximization from an OR perspective (Q2670513) (← links)
- Model development and solver demonstrations using randomized test problems (Q2689552) (← links)
- Maximum diversity/similarity models with extension to part grouping (Q3025047) (← links)
- Big segment small segment global optimization algorithm on networks (Q3113501) (← links)
- (Q3279348) (← links)
- (Q3315858) (← links)
- The maximal-dispersion problem (Q3991284) (← links)
- Heuristic and Special Case Algorithms for Dispersion Problems (Q4301294) (← links)
- (Q4550924) (← links)
- Solving the Continuous <i>p</i>-Dispersion Problem Using Non-linear Programming (Q4838220) (← links)
- A novel maximum dispersion territory design model arising in the implementation of the WEEE-directive (Q4933620) (← links)
- Lagrangian solution of maximum dispersion problems (Q4949160) (← links)
- Facility dispersion and remote subgraphs (Q5054806) (← links)
- The Location of Undesirable Facilities (Q5506725) (← links)
- (Q5535031) (← links)
- Max-min dispersion on a line (Q5918519) (← links)
- Away from each other (Q6091146) (← links)
- An exact cutting plane method for the Euclidean max-sum diversity problem (Q6096568) (← links)
- Location Science in Canada (Q6102878) (← links)
- The repeated <i>p</i>-dispersion problem (Q6155626) (← links)
- Formulations and valid inequalities for the capacitated dispersion problem (Q6179719) (← links)
- Optimal control sphere packing problem (Q6541617) (← links)
- A constructive heuristic for the uniform capacitated vertex \(k\)-center problem (Q6579775) (← links)
- Dispersion problem on a convex polygon (Q6602315) (← links)
