Home › Entities › academia › Learning generalized strong branching for set covering, set packing, and 0–1 knapsack problems

Learning generalized strong branching for set covering, set packing, and 0–1 knapsack problems

Research article (European Journal of Operational Research, 2021) · cited 16× · AI/ML
CreativeWork academia openalex:W3216362854
Press Enter · cited answer in seconds

Summary

Learning generalized strong branching for set covering, set packing, and 0–1 knapsack problems is a scholarly article[1].

Key Facts

  • Learning generalized strong branching for set covering, set packing, and 0–1 knapsack problems's instance of is recorded as scholarly article[2].

Related Entities

Bistra Dilkina

References

Programmatic citations — every numbered marker resolves to a verifiable graph row below.

Direct Wikidata claims

  1. [2] ↑ . wikidata.org.

Class ancestry

  1. [1] ↑ . Wikidata. wikidata.org.

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). Learning generalized strong branching for set covering, set packing, and 0–1 knapsack problems. Retrieved May 24, 2026, from https://4ort.xyz/entity/learning-generalized-strong-branching-for-set-covering-set-packing-and-01-knapsack-problems
MLA “Learning generalized strong branching for set covering, set packing, and 0–1 knapsack problems.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/learning-generalized-strong-branching-for-set-covering-set-packing-and-01-knapsack-problems.
BibTeX @misc{4ortxyz_learning-generalized-strong-branching-for-set-covering-set-packing-and-01-knapsack-problems_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Learning generalized strong branching for set covering, set packing, and 0–1 knapsack problems}}, year = {2026}, url = {https://4ort.xyz/entity/learning-generalized-strong-branching-for-set-covering-set-packing-and-01-knapsack-problems}, note = {Accessed: 2026-05-24}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Learning generalized strong branching for set covering, set packing, and 0–1 knapsack problems — https://4ort.xyz/entity/learning-generalized-strong-branching-for-set-covering-set-packing-and-01-knapsack-problems (retrieved 2026-05-24)

Canonical URL: https://4ort.xyz/entity/learning-generalized-strong-branching-for-set-covering-set-packing-and-01-knapsack-problems · Last refreshed: