𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the cardinality constrained matroid polytope

✍ Scribed by Jean François Maurras; Rüdiger Stephan

Publisher
John Wiley and Sons
Year
2011
Tongue
English
Weight
140 KB
Volume
57
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Bounds for the cardinality constrained P
Bounds for the cardinality constrained P∥Cmax problem
✍ Mauro Dell'Amico; Silvano Martello 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 150 KB

We consider the generalization of the classical P Cmax problem arising when a given limit k is imposed on the number of jobs that can be assigned to any machine. This generalization has practical interest in the optimization of assembly lines for printed circuit boards (PCB). The problem is strongly

Lawrence Oriented Matroids and a Problem
Lawrence Oriented Matroids and a Problem of McMullen on Projective Equivalences of Polytopes
✍ J.L. Ramı́rez Alfonsı́n 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 107 KB

Consider the following question introduced by McMullen: Determine the largest integer n = f (d) such that any set of n points in general position in the affine d-space R d can be mapped by a projective transformation onto the vertices of a convex polytope. It is known that 2d + 1 ≤ f (d) < (d + 1)(d

On the Connectivity Function of a Binary
On the Connectivity Function of a Binary Matroid
✍ Manoel Lemos 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 210 KB

In this paper, we shall consider the following problem: up to duality, is a connected matroid reconstructible from its connectivity function? Cunningham conjectured that this question has an affirmative answer, but Seymour gave a counter-example for it. In the same paper, Seymour proved that a conne