Solving the train marshalling problem by inclusion-exclusion (Q516904): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(7 intermediate revisions by 7 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2016.09.044 / rank
Normal rank
 
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C27 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C39 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6695133 / rank
 
Normal rank
Property / zbMATH Keywords
 
train marshalling
Property / zbMATH Keywords: train marshalling / rank
 
Normal rank
Property / zbMATH Keywords
 
fixed parameter tractability
Property / zbMATH Keywords: fixed parameter tractability / rank
 
Normal rank
Property / zbMATH Keywords
 
inclusion-exclusion principle
Property / zbMATH Keywords: inclusion-exclusion principle / rank
 
Normal rank
Property / zbMATH Keywords
 
dynamic programming
Property / zbMATH Keywords: dynamic programming / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2016.09.044 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2534499764 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inclusion and exclusion algorithm for the Hamiltonian path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms to count paths and cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: A finite-difference sieve to count paths and cycles by length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for exact satisfiability and number of perfect matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set Partitioning via Inclusion-Exclusion / rank
 
Normal rank
Property / cites work
 
Property / cites work: The train marshalling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shunting for Dummies: An Introductory Algorithmic Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multistage methods for freight train classification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic programming meets the principle of inclusion and exclusion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3851094 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3668280 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2016.09.044 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:13, 9 December 2024

scientific article
Language Label Description Also known as
English
Solving the train marshalling problem by inclusion-exclusion
scientific article

    Statements

    Solving the train marshalling problem by inclusion-exclusion (English)
    0 references
    0 references
    0 references
    15 March 2017
    0 references
    train marshalling
    0 references
    fixed parameter tractability
    0 references
    inclusion-exclusion principle
    0 references
    dynamic programming
    0 references

    Identifiers