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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B06 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C35 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C90 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6252090 / rank
 
Normal rank
Property / zbMATH Keywords
 
logistics
Property / zbMATH Keywords: logistics / rank
 
Normal rank
Property / zbMATH Keywords
 
heuristics
Property / zbMATH Keywords: heuristics / rank
 
Normal rank
Property / zbMATH Keywords
 
time definite
Property / zbMATH Keywords: time definite / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / 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
links / mardi / namelinks / mardi / name
 

Latest revision as of 06:54, 7 July 2024

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

    Statements

    Identifiers