Dealing with residual energy when transmitting data in energy-constrained capacitated networks (Q1750473): Difference between revisions

From MaRDI portal
Changed an Item
Created claim: Wikidata QID (P12): Q130200475, #quickstatements; #temporary_batch_1731343050658
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2791347813 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quickest path problem with interval lead times / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quickest path problem with batch constraints. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the quickest path problem and the reliable quickest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The energy-constrained quickest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the constrained quickest path problem and the enumeration of quickest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quickest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Internet packet routing: application of a \(K\)-quickest path algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriteria Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fibonacci heaps and their uses in improved network optimization algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2776597 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3888874 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A column generation heuristic for optimal wireless sensor network design with mobile sinks / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient alternative to the exact evaluation of the quickest path flow network reliability problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum energy target tracking with coverage guarantee in wireless sensor networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Calculation of minimal capacity vectors through \(k\) minimal paths under budget and time constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a special class of bicriterion path problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the quickest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A label-setting algorithm for finding a quickest path / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comprehensive survey on the quickest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the sum-max bicriterion path problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the quickest path problem and the enumeration of quickest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast and fine quickest path algorithm / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q130200475 / rank
 
Normal rank

Latest revision as of 17:37, 11 November 2024

scientific article
Language Label Description Also known as
English
Dealing with residual energy when transmitting data in energy-constrained capacitated networks
scientific article

    Statements

    Dealing with residual energy when transmitting data in energy-constrained capacitated networks (English)
    0 references
    0 references
    0 references
    0 references
    22 May 2018
    0 references
    networks
    0 references
    quickest path
    0 references
    energy constraint
    0 references
    minsum-maxmin
    0 references
    bi-objective optimization
    0 references
    0 references
    0 references

    Identifiers