Des algorithmes linéaires pour les problèmes de partition, de recouvrement et de couplage dans les hypergraphes d'intervalles (Q3048585): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1051/ro/1979130100131 / rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2586857425 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1051/RO/1979130100131 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 09:26, 20 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Des algorithmes linéaires pour les problèmes de partition, de recouvrement et de couplage dans les hypergraphes d'intervalles |
scientific article |
Statements
Des algorithmes linéaires pour les problèmes de partition, de recouvrement et de couplage dans les hypergraphes d'intervalles (English)
0 references
1979
0 references
integer programming
0 references
set partitioning problem
0 references
set covering problem
0 references
bin packing problem
0 references
interval hypergraph
0 references
dynamic programming
0 references
polynomial algorithms
0 references
computational complexity
0 references
