Pages that link to "Item:Q2496032"
From MaRDI portal
The following pages link to Upper bounds and exact algorithms for \(p\)-dispersion problems (Q2496032):
Displaying 30 items.
- An integer programming approach for solving the \(p\)-dispersion problem (Q323154) (← 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)
- Construction and improvement algorithms for dispersion problems (Q726217) (← links)
- Exact algorithms for the max-min dispersion problem (Q777304) (← links)
- A general heuristic for vehicle routing problems (Q869003) (← links)
- The equitable dispersion problem (Q1011261) (← links)
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method (Q1025986) (← links)
- Effective methods for solving the bi-criteria \(p\)-center and \(p\)-dispersion problem (Q1628040) (← links)
- On linearization techniques for budget-constrained binary quadratic programming problems (Q1709935) (← links)
- A new compact formulation for the discrete \(p\)-dispersion problem (Q1752169) (← links)
- Transmitter location for maximum coverage and constructive-destructive interference management (Q1762133) (← links)
- Solving \(k\)-cluster problems to optimality with semidefinite programming (Q1925793) (← links)
- Measuring diversity. A review and an empirical analysis (Q2029033) (← links)
- Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem (Q2030649) (← links)
- The conditional \(p\)-dispersion problem (Q2046325) (← links)
- \(t\)-linearization for the maximum diversity problem (Q2230803) (← links)
- On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study (Q2397091) (← links)
- Constrained 0-1 quadratic programming: basic approaches and extensions (Q2467302) (← links)
- Threshold-based preprocessing for approximating the weighted dense \(k\)-subgraph problem (Q2514764) (← links)
- On the unified dispersion problem: efficient formulations and exact algorithms (Q2629707) (← links)
- Variable neighborhood search for large offshore wind farm layout optimization (Q2669691) (← links)
- A review on discrete diversity and dispersion maximization from an OR perspective (Q2670513) (← links)
- Solving the Continuous <i>p</i>-Dispersion Problem Using Non-linear Programming (Q4838220) (← links)
- Lagrangian solution of maximum dispersion problems (Q4949160) (← links)
- Facility dispersion and remote subgraphs (Q5054806) (← links)
- The Location of Undesirable Facilities (Q5506725) (← links)
- An exact cutting plane method for the Euclidean max-sum diversity problem (Q6096568) (← links)
