On optimally solving sub‐tree scheduling for wireless sensor networks with partial coverage: A branch‐and‐cut algorithm (Q6179695): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Solution of a Large-Scale Traveling-Salesman Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Variable Neighborhood Search / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimization by Simulated Annealing / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the shortest spanning subtree of a graph and the traveling salesman problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Variable neighborhood search / rank | |||
Normal rank | |||
Revision as of 15:47, 21 August 2024
scientific article; zbMATH DE number 7780098
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On optimally solving sub‐tree scheduling for wireless sensor networks with partial coverage: A branch‐and‐cut algorithm |
scientific article; zbMATH DE number 7780098 |
Statements
On optimally solving sub‐tree scheduling for wireless sensor networks with partial coverage: A branch‐and‐cut algorithm (English)
0 references
18 December 2023
0 references
branch-and-cut algorithm
0 references
consecutive time slots
0 references
energy consumption minimization
0 references
partial coverage
0 references
sub-tree scheduling
0 references
wireless sensor network
0 references
