✦ LIBER ✦

Moonshine paths for 3A and 6A nodes of the extended -diagram

✍ Scribed by Griess, Robert L.; Lam, Ching Hung

Book ID: 123429446
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 414 KB
Volume: 379
Category: Article
ISSN: 0021-8693
DOI: 10.1016/j.jalgebra.2012.12.019

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Decomposition algorithms for finding the

Decomposition algorithms for finding the shortest path between a source node and a sink node of a network

✍ Suleyman Tufekci 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 489 KB

The Distribution of Path Losses for Unif

The Distribution of Path Losses for Uniformly Distributed Nodes in a Circle

✍ Bharucha, Zubin; Haas, Harald 📂 Article 📅 2008 🏛 Hindawi Limited 🌐 English ⚖ 683 KB

A methodology for prediction of forming

A methodology for prediction of forming limit stress diagrams considering the strain path effect

✍ A. Assempour; R. Hashemi; K. Abrinia; M. Ganjiani; E. Masoumi 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 306 KB

Phase Diagram of a Portion of the System

Phase Diagram of a Portion of the System Na3AlF6-AlF3-Al2O3.

✍ PERRY A. FOSTER JR. 📂 Article 📅 1975 🏛 John Wiley and Sons 🌐 English ⚖ 451 KB

THE USE OF ARCS AND NODES FOR THE DETERM

THE USE OF ARCS AND NODES FOR THE DETERMINATION OF CRITICAL PATHS IN PERT/CPM NETWORKS

✍ Anne B. Koehler; Richard H. McClure 📂 Article 📅 1979 🏛 Decision Sciences Institute, Georgia State Univers 🌐 English ⚖ 206 KB

A dynamic programming algorithm for the

A dynamic programming algorithm for the shortest path problem with time windows and linear node costs

✍ Ioachim, Irina; G�linas, Sylvie; Soumis, Fran�ois; Desrosiers, Jacques 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 154 KB 👁 3 views

This paper presents an optimal dynamic programming algorithm, the first such algorithm in the literature to solve the shortest path problem with time windows and additional linear costs on the node service start times. To optimally solve this problem, we propose a new dynamic programming algorithm w