The following pages link to (Q4867320):
Displayed 9 items.
- Subset selection from large datasets for kriging modeling (Q381304) (← links)
- Good solutions to discrete noxious location problems via metaheuristics (Q689250) (← links)
- A branch-and-cut method for the obnoxious \(p\)-median problem (Q926563) (← links)
- The equitable dispersion problem (Q1011261) (← links)
- Analytical models for locating undesirable facilities (Q1118522) (← links)
- On linearization techniques for budget-constrained binary quadratic programming problems (Q1709935) (← links)
- The discrete p-maxian location problem (Q1824542) (← links)
- A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks (Q2366611) (← links)
- Upper bounds and exact algorithms for \(p\)-dispersion problems (Q2496032) (← links)