✦ LIBER ✦

Flows on few paths: Algorithms and lower bounds

✍ Scribed by Maren Martens; Martin Skutella

Publisher: John Wiley and Sons
Year: 2006
Tongue: English
Weight: 208 KB
Volume: 48
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.20121

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A branch-and-bound algorithm for flow-pa

A branch-and-bound algorithm for flow-path design of automated guided vehicle systems

✍ M. A. Venkataramanan; Kathryn A. Wilson 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 624 KB

An algorithm for determining the optimal, unidirectional flow path for an automated guided vehicle system with a given facility layout is presented. The problem is formulated as an integer program. The objective is to minimize the total distance traveled by vehicles subject to the constraint that th

Lower bounds and algorithms for flowtime

Lower bounds and algorithms for flowtime minimization on a single machine with set-up times

✍ Simon Dunstall; Andrew Wirth; Kenneth Baker 📂 Article 📅 2000 🏛 Springer US 🌐 English ⚖ 165 KB 👁 3 views

We consider the scheduling of N jobs divided into G families for processing on a single machine. No set-up is necessary between jobs belonging to the same family. A set-up must be scheduled when switching from the processing of family i jobs to those of another family j, i = j, the duration of this

Improved lower bounds on k-independence

✍ Yair Caro; Zsolt Tuza 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 418 KB

## Abstract A vertex set __Y__ in a (hyper)graph is called __k__‐independent if in the sub(hyper)‐graph induced by __Y__ every vertex is incident to less than __k__ edges. We prove a lower bound for the maximum cardinality of a __k__‐independent set—in terms of degree sequences—which strengthens an

On minimum reload cost paths, tours, and

On minimum reload cost paths, tours, and flows

✍ Edoardo Amaldi; Giulia Galbiati; Francesco Maffioli 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 267 KB

A lower bound on the average shortest pa

A lower bound on the average shortest path length in regular graphs

✍ V. G. Cerf; D. D. Cowan; R. C. Mullin; R. G. Stanton 📂 Article 📅 1974 🏛 John Wiley and Sons 🌐 English ⚖ 226 KB

Upper and lower bounds for the average-c

Upper and lower bounds for the average-case complexity of path-search

✍ Pippenger, Nicholas 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 125 KB 👁 1 views

A channel graph is the union of all paths between a given input and a given output in an interconnection network. At any moment in time, each vertex in such a graph is either idle or busy. The search problem that we consider is to find a path (from the given input to the given output) consisting ent