The following pages link to (Q4037432):
Displaying 14 items.
- The \(p\)-neighbor \(k\)-center problem (Q293209) (← links)
- Representation of the non-dominated set in biobjective discrete optimization (Q342058) (← links)
- Approximation with a fixed number of solutions of some multiobjective maximization problems (Q396664) (← links)
- An O\((\log k)\)-approximation algorithm for the \(k\) minimum spanning tree problem in the plane (Q679454) (← links)
- A heuristic approach for the max-min diversity problem based on max-clique (Q1010298) (← links)
- Integer-friendly formulations for the \(r\)-separation problem (Q1268268) (← links)
- A comparison of \(p\)-dispersion heuristics (Q1342949) (← links)
- \(k\)-edge subgraph problems (Q1356515) (← links)
- Dispersing points on intervals (Q1706121) (← links)
- Fast approximation algorithms for \(p\)-centers in large \(\delta\)-hyperbolic graphs (Q1799228) (← links)
- An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints (Q2492210) (← links)
- Sequential Design of Experiment for Sparse Polynomial Chaos Expansions (Q4636350) (← links)
- Greedily finding a dense subgraph (Q5054810) (← links)
- Compact location problems with budget and communication constraints (Q6064048) (← links)
