Pages that link to "Item:Q4301294"
From MaRDI portal
The following pages link to Heuristic and Special Case Algorithms for Dispersion Problems (Q4301294):
Displayed 17 items.
- Discrete location problems with push-pull objectives (Q697575) (← 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)
- 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)
- An \(O(mn^ 2)\) algorithm for the maximin problem in \(E^ 2\) (Q1924622) (← links)
- Iterated tabu search for the maximum diversity problem (Q2381330) (← 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)
- (Q4949160) (← links)
- Maximum dispersion problem in dense graphs (Q5929139) (← links)
- A Lagrangian relaxation approach to the edge-weighted clique problem (Q5937353) (← links)