𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A multiply constrained matroid optimization problem

✍ Scribed by F. Rendl; M. Leclerc

Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
687 KB
Volume
73
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

We consider the problem of finding a minimum weight basis in a matroid satisfying additional conditions which can be described as follows: each element of the matroid is assigned a colour and feasible bases can use at most a prescribed number of elements from each colour. This problem is a special case of weighted matroid intersection. We provide an algorithm for this problem which improves general matroid intersection algorithms by exploiting the simple structure of the side constraints.

πŸ“œ SIMILAR VOLUMES

Constrained matroidal bottleneck problem
Constrained matroidal bottleneck problems
✍ Igor Averbakh; Oded Berman; Abraham P. Punnen πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 894 KB
On the structure of Lagrange multipliers
On the structure of Lagrange multipliers for state-constrained optimal control problems
✍ Maı̈tine Bergounioux; Karl Kunisch πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 201 KB

## Nous dà edions cet article  a Jacques-Louis Lions, qui fut, non seulement un mathà ematicien exceptionnel mais aussi un homme dont les qualità es personnelles à egalaient les qualità es scientiÿques. Il nous restera le souvenir d'un homme attentif et courtois quelque soit son interlocuteur.

A constrained optimization problem for a
A constrained optimization problem for a processor sharing queue
✍ Peter De Waal πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 765 KB

In this article we discuss a processor sharing queueing model for a stored program controlled telephone exchange. The model incorporates the effects of both call requests and operator tasks on the load of the processor. Newly arriving call requests and operator tasks can either be admitted or reject