Pages that link to "Item:Q2492210"

The following pages link to An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints (Q2492210):

Displaying 22 items.

• Cardinality constrained combinatorial optimization: complexity and polyhedra (Q429646) (← links)
• A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: facet-defining inequalities by sequential lifting (Q429688) (← links)
• Counting or producing all fixed cardinality transversals (Q472469) (← links)
• On simple combinatorial optimization problems. A collection of contributions in honour of Jack van Lint (Q687374) (← links)
• On \(k\)-Max-optimization (Q1002079) (← links)
• The bottleneck \(k\)-MST (Q1041824) (← links)
• Cardinality constrained minimum cut problems: complexity and algorithms. (Q1427809) (← links)
• Parameterized and approximation complexity of \textsc{Partial VC Dimension} (Q1731844) (← links)
• The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs (Q1756342) (← links)
• Fixed cardinality stable sets (Q1983123) (← links)
• Optimization of product category allocation in multiple warehouses to minimize splitting of online supermarket customer orders (Q2029376) (← links)
• The unsuitable neighbourhood inequalities for the fixed cardinality stable set polytope (Q2056893) (← links)
• An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems (Q2354725) (← links)
• On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study (Q2397091) (← links)
• Approximation algorithms for \(k\)-partitioning problems with partition matroid constraint (Q2448182) (← links)
• An Efficient PTAS for Parallel Machine Scheduling with Capacity Constraints (Q2958349) (← links)
• (Q4382664) (← links)
• Constrained Graph Partitioning via Matrix Differential Equations (Q4615297) (← links)
• A Note on Edge Isoperimetric Numbers and Regular Graphs (Q5298314) (← links)
• On solving the densest<i>k</i>-subgraph problem on large graphs (Q5859000) (← links)
• Parameterized algorithms for the happy set problem (Q5919103) (← links)
• Approximation guarantees for min-max-min robust optimization and \(k\)-adaptability under objective uncertainty (Q6561382) (← links)