Pages that link to "Item:Q1824542"
From MaRDI portal
The following pages link to The discrete p-maxian location problem (Q1824542):
Displaying 20 items.
- The \(p\)-Maxian problem on interval graphs (Q608284) (← links)
- Good solutions to discrete noxious location problems via metaheuristics (Q689250) (← links)
- Discrete location problems with push-pull objectives (Q697575) (← links)
- Computational geometric aspects of rhythm, melody, and voice-leading (Q733549) (← links)
- A branch-and-cut method for the obnoxious \(p\)-median problem (Q926563) (← links)
- Analytical models for locating undesirable facilities (Q1118522) (← links)
- A discretizing algorithm for location problems (Q1129969) (← links)
- Maximin location: Discretization not always works (Q1284606) (← links)
- A bibliography for some fundamental problem categories in discrete location science (Q2384836) (← links)
- Public facility location using dispersion, population, and equity criteria (Q2514787) (← links)
- The maximal dispersion problem and the ``first point outside the neighbourhood'' heuristic (Q2638928) (← links)
- A local analysis to determine all optimal solutions of \(p\)-\(k\)-\(\max\) location problems on networks (Q2664012) (← links)
- Review of obnoxious facilities location problems (Q2669654) (← links)
- Maximum diversity/similarity models with extension to part grouping (Q3025047) (← links)
- Location of Multiple Obnoxious Facilities (Q3748029) (← links)
- Obnoxious Facility Location on Graphs (Q3985539) (← links)
- (Q4340077) (← links)
- Lagrangian solution of maximum dispersion problems (Q4949160) (← links)
- A Lagrangian relaxation approach to the edge-weighted clique problem (Q5937353) (← links)
- Location Science in Canada (Q6102878) (← links)
