An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints (Q2492210): Difference between revisions

@@ Property / describes a project that uses @@
+Knapsack
@@ Property / describes a project that uses: Knapsack / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2005.05.036
+Normal rank
@@ Property / OpenAlex ID @@
+W2027038333
@@ Property / OpenAlex ID: W2027038333 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4263699
@@ Property / cites work: Q4263699 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding k points with minimum diameter and related problems
+Normal rank
@@ Property / cites work @@
+Lot-sizing polyhedra with a cardinality constraint
+Normal rank
@@ Property / cites work @@
+Q3056948
@@ Property / cites work: Q3056948 / rank @@
+Normal rank
@@ Property / cites work @@
+Color-coding
@@ Property / cites work: Color-coding / rank @@
+Normal rank
@@ Property / cites work @@
+Q4395317
@@ Property / cites work: Q4395317 / rank @@
+Normal rank
@@ Property / cites work @@
+A 2.5-factor approximation algorithm for the \(k\)-MST problem
+Normal rank
@@ Property / cites work @@
+Greedily Finding a Dense Subgraph
@@ Property / cites work: Greedily Finding a Dense Subgraph / rank @@
+Normal rank
@@ Property / cites work @@
+Q4234074
@@ Property / cites work: Q4234074 / rank @@
+Normal rank
@@ Property / cites work @@
+New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen
+Normal rank
@@ Property / cites work @@
+Q4474134
@@ Property / cites work: Q4474134 / rank @@
+Normal rank
@@ Property / cites work @@
+The \(k\)-partitioning problem
@@ Property / cites work: The \(k\)-partitioning problem / rank @@
+Normal rank
@@ Property / cites work @@
+On \(k\)-partitioning of Hamming graphs
@@ Property / cites work: On \(k\)-partitioning of Hamming graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On Bounds for the k-Partitioning of Graphs
@@ Property / cites work: On Bounds for the k-Partitioning of Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+New metaheuristic approaches for the edge-weighted \(k\)-cardinality tree problem
+Normal rank
@@ Property / cites work @@
+Q4234076
@@ Property / cites work: Q4234076 / rank @@
+Normal rank
@@ Property / cites work @@
+Local search algorithms for the \(k\)-cardinality tree problem.
+Normal rank
@@ Property / cites work @@
+A constant-factor approximation algorithm for the \(k\)-MST problem
+Normal rank
@@ Property / cites work @@
+On Linear Time Minor Tests with Depth-First Search
+Normal rank
@@ Property / cites work @@
+Decomposing Matrices into Blocks
@@ Property / cites work: Decomposing Matrices into Blocks / rank @@
+Normal rank
@@ Property / cites work @@
+Cardinality constrained minimum cut problems: complexity and algorithms.
+Normal rank
@@ Property / cites work @@
+Genetic algorithm and graph partitioning
@@ Property / cites work: Genetic algorithm and graph partitioning / rank @@
+Normal rank
@@ Property / cites work @@
+Lexicographic bottleneck problems
@@ Property / cites work: Lexicographic bottleneck problems / rank @@
+Normal rank
@@ Property / cites work @@
+Search-hide games on trees
@@ Property / cites work: Search-hide games on trees / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for knapsack problems with cardinality constraints
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for Dispersion Problems
@@ Property / cites work: Approximation Algorithms for Dispersion Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Algorithms for k-Shredders and k-Node Connectivity Augmentation
+Normal rank
@@ Property / cites work @@
+The Optimal Partitioning of Graphs
@@ Property / cites work: The Optimal Partitioning of Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3147658
@@ Property / cites work: Q3147658 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4509378
@@ Property / cites work: Q4509378 / rank @@
+Normal rank
@@ Property / cites work @@
+The \(k\)-cardinality assignment problem
@@ Property / cites work: The \(k\)-cardinality assignment problem / rank @@
+Normal rank
@@ Property / cites work @@
+Bounds for the cardinality constrained \(P \|C_{max}\) problem
+Normal rank
@@ Property / cites work @@
+Lower Bounds for the Partitioning of Graphs
@@ Property / cites work: Lower Bounds for the Partitioning of Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4503944
@@ Property / cites work: Q4503944 / rank @@
+Normal rank
@@ Property / cites work @@
+The computational complexity of the \(k\)-minimum spanning tree problem in graded matrices
+Normal rank
@@ Property / cites work @@
+Q4836293
@@ Property / cites work: Q4836293 / rank @@
+Normal rank
@@ Property / cites work @@
+\(K\)-tree/\(K\)-subgraph: A program package for minimal weighted \(K\)-cardinlity trees and subgraphs
+Normal rank
@@ Property / cites work @@
+Q4208337
@@ Property / cites work: Q4208337 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4763392
@@ Property / cites work: Q4763392 / rank @@
+Normal rank
@@ Property / cites work @@
+Faster geometric \(k\)-point MST approximation
@@ Property / cites work: Faster geometric \(k\)-point MST approximation / rank @@
+Normal rank
@@ Property / cites work @@
+Computational Complexity of Some Maximum Average Weight Problems with Precedence Constraints
+Normal rank
@@ Property / cites work @@
+The dense \(k\)-subgraph problem
@@ Property / cites work: The dense \(k\)-subgraph problem / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for Maximization Problems Arising in Graph Partitioning
+Normal rank
@@ Property / cites work @@
+Q5501299
@@ Property / cites work: Q5501299 / rank @@
+Normal rank
@@ Property / cites work @@
+Weighted <i>k</i>‐cardinality trees: Complexity and polyhedral structure
+Normal rank
@@ Property / cites work @@
+Integer programming approaches to facilities layout models with forbidden areas
+Normal rank
@@ Property / cites work @@
+Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION
+Normal rank
@@ Property / cites work @@
+Forest covers and a polyhedral intersection theorem
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Technical Note—An Improved Algorithm for the Bottleneck Assignment Problem
+Normal rank
@@ Property / cites work @@
+An O\((\log k)\)-approximation algorithm for the \(k\) minimum spanning tree problem in the plane
+Normal rank
@@ Property / cites work @@
+Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
+Normal rank
@@ Property / cites work @@
+\(k\)-edge subgraph problems
@@ Property / cites work: \(k\)-edge subgraph problems / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for the <i>k</i>-Clique Covering Problem
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for minimum \(K\)-cut
@@ Property / cites work: Approximation algorithms for minimum \(K\)-cut / rank @@
+Normal rank
@@ Property / cites work @@
+Q4886044
@@ Property / cites work: Q4886044 / rank @@
+Normal rank
@@ Property / cites work @@
+On center cycles in grid graphs
@@ Property / cites work: On center cycles in grid graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The NP-Completeness of Some Edge-Partition Problems
+Normal rank
@@ Property / cites work @@
+Q4216482
@@ Property / cites work: Q4216482 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4400639
@@ Property / cites work: Q4400639 / rank @@
+Normal rank
@@ Property / cites work @@
+Upper and lower bounding procedures for minimum rooted \(k\)-subtree problem
+Normal rank
@@ Property / cites work @@
+Cardinality constrained bin-packing problems
@@ Property / cites work: Cardinality constrained bin-packing problems / rank @@
+Normal rank
@@ Property / cites work @@
+An Efficient Heuristic Procedure for Partitioning Graphs
+Normal rank
@@ Property / cites work @@
+Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer Systems
+Normal rank
@@ Property / cites work @@
+Compact location problems
@@ Property / cites work: Compact location problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4398373
@@ Property / cites work: Q4398373 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5687198
@@ Property / cites work: Q5687198 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5187226
@@ Property / cites work: Q5187226 / rank @@
+Normal rank
@@ Property / cites work @@
+Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
+Normal rank
@@ Property / cites work @@
+Q3997942
@@ Property / cites work: Q3997942 / rank @@
+Normal rank
@@ Property / cites work @@
+Spanning Trees—Short or Small
@@ Property / cites work: Spanning Trees—Short or Small / rank @@
+Normal rank
@@ Property / cites work @@
+Hybrid rounding techniques for knapsack problems
@@ Property / cites work: Hybrid rounding techniques for knapsack problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4083480
@@ Property / cites work: Q4083480 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4875213
@@ Property / cites work: Q4875213 / rank @@
+Normal rank
@@ Property / cites work @@
+Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, <i>k</i>-MST, and Related Problems
+Normal rank
@@ Property / cites work @@
+A Constant-Factor Approximation Algorithm for the Geometric<i>k</i>-MST Problem in the Plane
+Normal rank
@@ Property / cites work @@
+The cardinality and precedence constrained maximum value sub-hypergraph problem and its applications
+Normal rank
@@ Property / cites work @@
+Q4037432
@@ Property / cites work: Q4037432 / rank @@
+Normal rank
@@ Property / cites work @@
+Heuristic and Special Case Algorithms for Dispersion Problems
+Normal rank
@@ Property / cites work @@
+A projection technique for partitioning the nodes of a graph
+Normal rank
@@ Property / cites work @@
+Graph minors. IV: Tree-width and well-quasi-ordering
+Normal rank
@@ Property / cites work @@
+Finding <i>k</i> Cuts within Twice the Optimal
@@ Property / cites work: Finding <i>k</i> Cuts within Twice the Optimal / rank @@
+Normal rank
@@ Property / cites work @@
+The facility selection-location problem
@@ Property / cites work: The facility selection-location problem / rank @@
+Normal rank
@@ Property / cites work @@
+Heuristically determining cliques of given cardinality and with minimal cost within weighted complete graphs
+Normal rank
@@ Property / cites work @@
+Asymptotic Analysis of an Algorithm for Balanced Parallel Processor Scheduling
+Normal rank
@@ Property / cites work @@
+Variable neighborhood decomposition search for the edge weighted \(k\)-cardinality tree problem
+Normal rank
@@ Property / cites work @@
+Minimum Covers of Fixed Cardinality in Weighted Graphs
+Normal rank
@@ Property / cites work @@
+The maximal dispersion problem and the ``first point outside the neighbourhood'' heuristic
+Normal rank
@@ Property / cites work @@
+An efficient algorithm for minimumk-covers in weighted graphs
+Normal rank
@@ Property / cites work @@
+Q4274209
@@ Property / cites work: Q4274209 / rank @@
+Normal rank