Scheduling arc maintenance jobs in a network to maximize total flow over time (Q406493): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(11 intermediate revisions by 8 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2012.05.027 / rank
Normal rank
 
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B35 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B25 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6341240 / rank
 
Normal rank
Property / zbMATH Keywords
 
network flows
Property / zbMATH Keywords: network flows / rank
 
Normal rank
Property / zbMATH Keywords
 
scheduling
Property / zbMATH Keywords: scheduling / rank
 
Normal rank
Property / zbMATH Keywords
 
maintenance planning
Property / zbMATH Keywords: maintenance planning / rank
 
Normal rank
Property / zbMATH Keywords
 
local search
Property / zbMATH Keywords: local search / rank
 
Normal rank
Property / zbMATH Keywords
 
hybrid algorithms
Property / zbMATH Keywords: hybrid algorithms / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Boost C++ Libraries / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Boost / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: BGL / 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.1016/j.dam.2012.05.027 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2052429767 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q57955352 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universally maximum flow with piecewise-constant capacities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5514188 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal dynamic routing in communication networks with continuous traffic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3128904 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Continuous and discrete flows over time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restoring infrastructure systems: an integrated network design and scheduling (INDS) problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum-delay routing in continuous-time dynamic networks with Piecewise-constant capacities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2753185 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Introduction to Network Flows over Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing inventory routing problems with approximate value functions / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/dam/BolandKWZ14 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2012.05.027 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:36, 9 December 2024

scientific article
Language Label Description Also known as
English
Scheduling arc maintenance jobs in a network to maximize total flow over time
scientific article

    Statements

    Scheduling arc maintenance jobs in a network to maximize total flow over time (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    8 September 2014
    0 references
    network flows
    0 references
    scheduling
    0 references
    maintenance planning
    0 references
    local search
    0 references
    hybrid algorithms
    0 references
    0 references
    0 references
    0 references

    Identifiers