Pages that link to "Item:Q3292586"
From MaRDI portal
The following pages link to Covers and packings in a family of sets (Q3292586):
Displaying 21 items.
- A surprising permanence of old motivations (a not-so-rigid story) (Q1045032) (← links)
- A formal model of diagnostic inference. I. Problem formulation and decomposition (Q1069317) (← links)
- A formal model of diagnostic inference. II. Algorithmic solution and application (Q1069318) (← links)
- The complexity of lifted inequalities for the knapsack problem (Q1201098) (← links)
- Covers, matchings and odd cycles of a graph (Q1219306) (← links)
- Electronic circuit diagnostic expert systems - a survey (Q1262111) (← links)
- The maximum clique problem (Q1318271) (← links)
- Solving the anti-covering location problem using Lagrangian relaxation (Q1373891) (← links)
- Graph theoretic relaxations of set covering and set partitioning problems (Q1390264) (← links)
- Relaxed tours and path ejections for the traveling salesman problem (Q1609913) (← links)
- Robust min-max regret covering problems (Q2162527) (← links)
- Maximum internally stable sets of a graph (Q2530476) (← links)
- On cliques associated to 3-set packing problems (Q3439164) (← links)
- Determining the number of internal stability of a graph (Q3960887) (← links)
- Semiantichains and Unichain Coverings in Direct Products of Partial Orders (Q3966188) (← links)
- Vertex packings: Structural properties and algorithms (Q4074668) (← links)
- An efficient algorithm for minimumk-covers in weighted graphs (Q4083700) (← links)
- Transitive packing (Q4645940) (← links)
- Properties of vertex packing and independence system polyhedra (Q4766816) (← links)
- On the facial structure of set packing polyhedra (Q5181532) (← links)
- Fix-and-optimize metaheuristics for minmax regret binary integer programming problems under interval uncertainty (Q6186579) (← links)
