Algorithms - ESA 2003
From MaRDI portal
Publication:5897288
DOI10.1007/b13632zbMath1266.90106OpenAlexW1827234103WikidataQ60299159 ScholiaQ60299159MaRDI QIDQ5897288
Publication date: 3 March 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b13632
Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35)
Related Items (18)
A characterization of circle graphs in terms of total unimodularity ⋮ New length bounds for cycle bases ⋮ An experimental comparison of periodic timetabling models ⋮ Classes of cycle bases ⋮ On a Special Co-cycle Basis of Graphs ⋮ Integrating Passengers' Routes in Periodic Timetabling: A SAT approach. ⋮ Cycle bases in graphs characterization, algorithms, complexity, and applications ⋮ Railway track allocation: Models and methods ⋮ Integral cycle bases for cyclic timetabling ⋮ Edge-swapping algorithms for the minimum fundamental cycle basis problem ⋮ Minimizing the waiting time for a one-way shuttle service ⋮ Minimum Cycle Bases and Their Applications ⋮ A combinatorial proof of the removal lemma for groups ⋮ Minimum weakly fundamental cycle bases are hard to find ⋮ Properties of Gomory-Hu co-cycle bases ⋮ Cyclic matrices of weighted digraphs ⋮ A greedy approach to compute a minimum cycle basis of a directed graph ⋮ Minimum cycle bases of graphs over different fields
This page was built for publication: Algorithms - ESA 2003
