enumerateTSP

enumerateMST

These functions enumerate all candidate solutions for
a certain combinatorial optimization problem, e.g., all permutations
for a TSP or all Pruefer-codes for a MST problem. Note that the output
grows exponentially with the instance size <code>n</code>.

Algorithms to approximate the Pareto-front of multi-criteria minimum spanning tree problems. Additionally, a modular toolbox for the generation of multi-objective benchmark graph problems is included.

Jakob Bossek

mcMST

A Toolbox for the Multi-Criteria Minimum Spanning Tree Problem

enumerateTSP function

<dl><dt>n</dt>
<dd>[<code>integer(1)</code>] 
Instance size.</dd></dl>

Arguments

Enumerate all solution candidates. — enumerateTSP

<dl>

<dt>n</dt>
<dd>[<code>integer(1)</code>] 
Instance size.</dd>

</dl>

enumerateTSP: Enumerate all solution candidates.

Description

Usage

Value

Arguments

Examples