Pages that link to "Item:Q4301294"
From MaRDI portal
The following pages link to Heuristic and Special Case Algorithms for Dispersion Problems (Q4301294):
Displaying 50 items.
- An integer programming approach for solving the \(p\)-dispersion problem (Q323154) (← links)
- Maxminmin \(p\)-dispersion problem: a variable neighborhood search approach (Q337222) (← links)
- \(p\)-median and \(p\)-dispersion problems: a bi-criteria analysis (Q337587) (← links)
- Subset selection from large datasets for kriging modeling (Q381304) (← links)
- On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs (Q448967) (← links)
- Heuristic solution approaches for the maximum minsum dispersion problem (Q513174) (← links)
- Approximation accuracy, gradient methods, and error bound for structured convex optimization (Q607498) (← links)
- Integer point sets minimizing average pairwise \(L_{1}\) distance: What is the optimal shape of a town? (Q621921) (← links)
- Discrete location problems with push-pull objectives (Q697575) (← links)
- Construction and improvement algorithms for dispersion problems (Q726217) (← links)
- Computational geometric aspects of rhythm, melody, and voice-leading (Q733549) (← links)
- Approximate solutions of continuous dispersion problems (Q816409) (← links)
- The discrete p-dispersion problem (Q915643) (← links)
- A constant approximation algorithm for the densest \(k\)-subgraph problem on chordal graphs (Q963469) (← links)
- The equitable dispersion problem (Q1011261) (← links)
- Integer-friendly formulations for the \(r\)-separation problem (Q1268268) (← links)
- An extended formulation approach to the edge-weighted maximal clique problem (Q1278438) (← links)
- A comparison of \(p\)-dispersion heuristics (Q1342949) (← links)
- Minimum dispersion problems (Q1363766) (← links)
- Solving the anti-covering location problem using Lagrangian relaxation (Q1373891) (← links)
- Approximation algorithms for maximum dispersion (Q1375119) (← links)
- Compact location problems (Q1391322) (← links)
- Approximating the maximum quadratic assignment problem (Q1607075) (← links)
- Complexity of finding dense subgraphs (Q1613384) (← links)
- Effective methods for solving the bi-criteria \(p\)-center and \(p\)-dispersion problem (Q1628040) (← links)
- Dispersing points on intervals (Q1706121) (← links)
- Dispersion with connectivity in wireless mesh networks (Q1716989) (← links)
- An \(O(mn^ 2)\) algorithm for the maximin problem in \(E^ 2\) (Q1924622) (← links)
- A linear time approximation scheme for computing geometric maximum \(k\)-star (Q1942028) (← links)
- Facility dispersion problems under capacity and cost constraints (Q1977861) (← links)
- A hybrid heuristic for the maximum dispersion problem (Q2028755) (← links)
- Measuring diversity. A review and an empirical analysis (Q2029033) (← links)
- An efficient low complexity algorithm for box-constrained weighted maximin dispersion problem (Q2031386) (← links)
- The maximum diversity assortment selection problem (Q2040441) (← links)
- New approximation algorithms for weighted maximin dispersion problem with box or ball constraints (Q2046695) (← links)
- Maximization problems of balancing submodular relevance and supermodular diversity (Q2070370) (← links)
- The hub location and pricing problem (Q2140288) (← links)
- Result diversification by multi-objective evolutionary algorithms with theoretical guarantees (Q2152498) (← links)
- Approximability of the dispersed \(\vec{p}\)-neighbor \(k\)-supplier problem (Q2217474) (← links)
- Dispersing and grouping points on planar segments (Q2232600) (← links)
- A hybrid metaheuristic method for the maximum diversity problem (Q2356110) (← links)
- A new family of facet defining inequalities for the maximum edge-weighted clique problem (Q2361127) (← links)
- Iterated tabu search for the maximum diversity problem (Q2381330) (← links)
- An improved analysis for a greedy remote-clique algorithm using factor-revealing LPs (Q2391186) (← links)
- Finding connected \(k\)-subgraphs with high density (Q2407097) (← links)
- The densest \(k\)-subgraph problem on clique graphs (Q2426654) (← links)
- An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints (Q2492210) (← links)
- Upper bounds and exact algorithms for \(p\)-dispersion problems (Q2496032) (← links)
- On the unified dispersion problem: efficient formulations and exact algorithms (Q2629707) (← links)
- A review on algorithms for maximum clique problems (Q2630214) (← links)
