liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
The polymatroid assignment problem
Linköping University, Department of Mathematics, Applied Mathematics. Linköping University, The Institute of Technology.
Linköping University, Department of Mathematics, Applied Mathematics. Linköping University, The Institute of Technology.
(English)Manuscript (preprint) (Other academic)
Abstract [en]

In 1998 G. Parisi published the two page note, with the conjecturedexact formula for the random bipartite matching (or assignment) problemwith exponential edge costs. This formula was subsequently proved and generalized in different directions. One such generalization given in was called the flow problem. Here we take the generalization process one step further. In a two-dimensional urn-processwas developed in order to calculate all moments of the cost of the flow problem. This process is here generalized to a larger class of optimization problems on the bipartite graph. These problems are defined by assigning a polymatroid structure to each of the two sets of vertices. An edge set isa feasible solution to the optimization problem if the two associated vertex(multi-)sets are both independent. Our main theorem states that the moments of the cost of the polymatroid assignment problem are characterizedby the associated urn process. We apply this theorem to some concrete problems which are not covered by previously known generalization of the bipartite matching problem.

National Category
Mathematics
Identifiers
URN: urn:nbn:se:liu:diva-51717OAI: oai:DiVA.org:liu-51717DiVA: diva2:277094
Available from: 2009-11-16 Created: 2009-11-16 Last updated: 2009-11-16Bibliographically approved
In thesis
1. Optimization, Matroids and Error-Correcting Codes
Open this publication in new window or tab >>Optimization, Matroids and Error-Correcting Codes
2009 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

The first subject we investigate in this thesis deals with optimization problems on graphs. The edges are given costs defined by the values of independent exponential random variables. We show how to calculate some or all moments of the distributions of the costs of some optimization problems on graphs.

The second subject that we investigate is 1-error correcting perfect binary codes, perfect codes for short. In most work about perfect codes, two codes are considered equivalent if there is an isometric mapping between them. We call this isometric equivalence. Another type of equivalence is given if two codes can be mapped on each other using a non-singular linear map. We call this linear equivalence. A third type of equivalence is given if two codes can be mapped on each other using a composition of an isometric map and a non-singular linear map. We call this extended equivalence.

  • In Paper 1 we give a new better bound on how much the cost of the matching problem with exponential edge costs varies from its mean.
  • In Paper 2 we calculate the expected cost of an LP-relaxed version of the matching problem where some edges are given zero cost. A special case is when the vertices with probability 1 – p have a zero cost loop, for this problem we prove that the expected cost is given by a formula.
  • In Paper 3 we define the polymatroid assignment problem and give a formula for calculating all moments of its cost.
  • In Paper 4 we present a computer enumeration of the 197 isometric equivalence classes of the perfect codes of length 31 of rank 27 and with a kernel of dimension 24.
  • In Paper 5 we investigate when it is possible to map two perfect codes on each other using a non-singular linear map.
  • In Paper 6 we give an invariant for the equivalence classes of all perfect codes of all lengths when linear equivalence is considered.
  • In Paper 7 we give an invariant for the equivalence classes of all perfect codes of all lengths when extended equivalence is considered.
  • In Paper 8 we define a class of perfect codes that we call FRH-codes. It is shown that each FRH-code is linearly equivalent to a so called Phelps code and that this class contains Phelps codes as a proper subset.
Place, publisher, year, edition, pages
Linköping: Linköping University Electronic Press, 2009. 55 p.
Series
Linköping Studies in Science and Technology. Dissertations, ISSN 0345-7524 ; 1277
National Category
Mathematics
Identifiers
urn:nbn:se:liu:diva-51722 (URN)978-91-7393-521-0 (ISBN)
Public defence
2009-12-16, Nobel (BL32), hus B, ing. 23, Campus Valla, Linköpings universitet, Linköping, 10:15 (English)
Opponent
Supervisors
Available from: 2009-11-16 Created: 2009-11-16 Last updated: 2010-01-12Bibliographically approved

Open Access in DiVA

No full text

Other links

Link to Ph.D. Thesis

Authority records BETA

Hessler, MartinWästlund, Johan

Search in DiVA

By author/editor
Hessler, MartinWästlund, Johan
By organisation
Applied MathematicsThe Institute of Technology
Mathematics

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 74 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf