Delay-constrained routing problems: accurate scheduling models and admission control (Q1652220): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.cor.2016.12.009 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W2344296803 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W2344296803 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q56523997 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Delay-constrained shortest paths: approximation algorithms and second-order cone models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network calculus. A theory of deterministic queueing systems for the Internet / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perspective cuts for a class of convex 0-1 mixed integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Projected Perspective Reformulations with Applications in Design Problems / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.COR.2016.12.009 / rank
 
Normal rank

Latest revision as of 01:02, 11 December 2024

scientific article
Language Label Description Also known as
English
Delay-constrained routing problems: accurate scheduling models and admission control
scientific article

    Statements

    Delay-constrained routing problems: accurate scheduling models and admission control (English)
    0 references
    0 references
    0 references
    0 references
    11 July 2018
    0 references
    routing problems
    0 references
    maximum delay constraints
    0 references
    scheduling algorithms
    0 references
    admission control
    0 references
    second-order cone programs
    0 references
    perspective reformulation
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references