✦ LIBER ✦

Transversal Graphs for Partially Ordered Sets: Sequencing, Merging and Scheduling Problems

✍ Scribed by Martin Middendorf; Vadim G. Timkovsky

Book ID: 110281676
Publisher: Springer US
Year: 1999
Tongue: English
Weight: 98 KB
Volume: 3
Category: Article
ISSN: 1382-6905
DOI: 10.1023/a:1009827520712

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Characterization problems for graphs, pa

Characterization problems for graphs, partially ordered sets, lattices, and families of sets

✍ William T. Trotter Jr.; John I. Moore Jr. 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 909 KB

A standard problem in combinatorial theory is to characterize structures which satisfy a certain property by providing a minimum list of forbidden substructures, for example, Kuratowski's well known characterization of planar graphs. In this paper, we establish connections between characterization p

Synthesizing optimization algorithms for

Synthesizing optimization algorithms for scheduling partially ordered set of problems

✍ V. V. Menshikh; E. Yu. Nikulina 📂 Article 📅 2012 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 124 KB

Turán-type results for partial orders an

Turán-type results for partial orders and intersection graphs of convex sets

✍ Jacob Fox; János Pach; Csaba D. Tóth 📂 Article 📅 2010 🏛 The Hebrew University Magnes Press 🌐 English ⚖ 255 KB

Rolling-horizon and fix-and-relax heuris

Rolling-horizon and fix-and-relax heuristics for the parallel machine lot-sizing and scheduling problem with sequence-dependent set-up costs

✍ Patrizia Beraldi; Gianpaolo Ghiani; Antonio Grieco; Emanuela Guerriero 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 186 KB

High-order conditions for a minimum on a

High-order conditions for a minimum on a set of sequences in the abstract problem with inequality and equality constraints

✍ A. A. Milyutin; N. P. Osmolovskii 📂 Article 📅 1993 🏛 Springer 🌐 English ⚖ 479 KB