Algorithm for solving the generalized set cover problem for a special class of problems (Q6188003): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Exact and heuristic algorithms for the maximum weighted submatrix coverage problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Curriculum spaces and mathematical models for curriculum design / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5167339 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An online-learning-based evolutionary many-objective algorithm / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The application of improved adaptive genetic algorithm in the optimization of discrete variables / rank | |||
Normal rank | |||
Revision as of 10:25, 26 August 2024
scientific article; zbMATH DE number 7798291
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithm for solving the generalized set cover problem for a special class of problems |
scientific article; zbMATH DE number 7798291 |
Statements
Algorithm for solving the generalized set cover problem for a special class of problems (English)
0 references
1 February 2024
0 references
