Integral cycle bases for cyclic timetabling (Q1013300): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disopt.2008.09.003 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: PESPLib / 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.disopt.2008.09.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1976461547 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Mathematical Model for Periodic Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3525417 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms - ESA 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3525416 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experimental and Efficient Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Periodic network optimization with different arc frequencies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4450523 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398864 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classes of cycle bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integral cycle bases for cyclic timetabling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4221106 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finding a cycle basis with a shortest maximal cycle / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3046492 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum cycle bases for network graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum cycle bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Generating Fundamental Cycles in a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum weakly fundamental cycle bases are hard to find / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4386084 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A greedy approach to compute a minimum cycle basis of a directed graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarks for Strictly Fundamental Cycle Bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower-Stretch Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Is every cycle basis fundamental? / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DISOPT.2008.09.003 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:49, 10 December 2024

scientific article
Language Label Description Also known as
English
Integral cycle bases for cyclic timetabling
scientific article

    Statements

    Integral cycle bases for cyclic timetabling (English)
    0 references
    0 references
    0 references
    17 April 2009
    0 references
    railway timetabling
    0 references
    minimum cycle bases
    0 references
    strictly fundamental cycle bases
    0 references

    Identifiers

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