getOptimalPointMatching

[<code>Network</code> | <code>matrix</code>]
First network or matrix of coordinates of the first point set.

[<code>Network</code> | <code>matrix</code>]
Second network or matrix of coordinates of the second point set.

[<code>character(1)</code>]
Method used to solve the assignment problem. There are currently two methods
available:<dl class="dl-horizontal">
 <dt>lp</dt><dd>Solves the problem be means of linear programming with the
 lpSolve package. This is the default.</dd>
 <dt>push_relabel</dt><dd>The assignment problem can be formulated as a
 matching problem on bipartite graphs. This method makes use of the
 push-relabel algorithm from the igraph.</dd>
 <dt>random</dt><dd>Random point matching.</dd>
</dl>

method

Internally it handles the points and the possible matchings as a bi-partite
graphs and finds an optimal matching due to euclidean distance by an
efficient linear programming solver.

Methods for the generation of a wide range of network geographies,
e.g., grid networks or clustered networks. Useful for the generation of
benchmarking instances for the investigation of, e.g., Vehicle-Routing-Problems
or Travelling Salesperson Problems.

Jakob Bossek

netgen

Network Generator for Combinatorial Graph Problems

getOptimalPointMatching function

[<code>character(1)</code>]
Method used to solve the assignment problem. There are currently two methods
available:<dl class='dl-horizontal'>
 <dt>lp</dt><dd>Solves the problem be means of linear programming with the
 lpSolve package. This is the default.</dd>
 <dt>push_relabel</dt><dd>The assignment problem can be formulated as a
 matching problem on bipartite graphs. This method makes use of the
 push-relabel algorithm from the igraph.</dd>
 <dt>random</dt><dd>Random point matching.</dd>
</dl>

getOptimalPointMatching: Computes optimal point assignment for two sets of points of equal size.

Description

Usage

Arguments

Value

See Also