𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The base-matroid and inverse combinatorial optimization problems

✍ Scribed by Mauro Dell'Amico; Francesco Maffioli; Federico Malucelli

Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
196 KB
Volume
128
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

✦ Synopsis

A new matroid is introduced: this matroid is deΓΏned starting from any matroid and one of its bases, hence we call it base-matroid. Besides some properties of the base-matroid, a non-trivial algorithm for the solution of the related matroid optimization problem is presented. The new matroid has application in the ΓΏeld of inverse combinatorial optimization problems. We discuss in detail the LP formulation of the inverse matroid optimization problem and we propose an e cient algorithm for computing its primal and dual solutions.

πŸ“œ SIMILAR VOLUMES

Combinatorial algorithms for inverse net
Combinatorial algorithms for inverse network flow problems
✍ Ravindra K. Ahuja; James B. Orlin πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 122 KB

An inverse optimization problem is defined as follows: Let S denote the set of feasible solutions of an optimization problem P, let c be a specified cost vector, and x 0 ʦ S. We want to perturb the cost vector c to d so that x 0 is an optimal solution of P with respect to the cost vector d, and wʈd

Synthesis, inverse problems and optimiza
Synthesis, inverse problems and optimization in computational electromagnetics
✍ S. Russenschuck πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 1012 KB

The paper gives an overview on mathematical optimization techniques specially suited to problems in electromagnetism. It is described how efficient optimization procedures consist of decision making, treatment of non-linear constraints, and an algorithm for minimizing the objective function. The opt