Back in the hazy olden days of the pre-2000s, navigating between two locations generally required someone to whip out a paper map and painstakingly figure out the most optimal route between those ...

This is a preview. Log in through your library . Abstract De nombreux réseaux célèbres (𝔻₄, 𝔼₈, le réseau K₁₂ de Coxeter-Todd, le réseau Λ₁₆ de Barnes-Wall, le réseau Λ₂₄ de Leech, les réseaux ...

The paper considers a project scheduling problem in weighted directed graphs in which arcs represent operations while nodes are identified with starting and finishing endpoints of the operations; arc ...