Network design for time-constrained delivery using subgraphs (Q395697): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10287-012-0154-2 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10287-012-0154-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2029261049 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2721331 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network design for time‐constrained delivery / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimax flow tree problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the minimum-cardinality-bounded-diameter and the bounded-cardinality- minimum-diameter edge addition problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of designing a network with minimum diameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the sum of all distances in a graph or digraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Light graphs with small routing cost / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10287-012-0154-2 / rank
 
Normal rank

Latest revision as of 16:19, 9 December 2024

scientific article
Language Label Description Also known as
English
Network design for time-constrained delivery using subgraphs
scientific article

    Statements

    Identifiers