You can submit a description of your graph to our algorithms via your W.W.W. browser. Our server will run our heuristics on your problems, following your specifications. The best solution found and other statistics will be returned to you online and optionally by e-mail.

---

Submit your problem:

• Equicut problem file:
• Note: The problem file must be in plain DIMACS format (see our tutorial) or in binary DIMACS format.
  Here you can find a converter from plain DIMACS format to binary DIMACS format.
  If the edge density of the graph is bigger than ~1.2%, the binary storage is more space efficient. So it is preferable to convert an ascii Dimacs file to the binary format before uploading to our server.

---

Fill the following field to receive an e-mail with a copy of the output of the program. If the field is empty, the output will be only in your browser.
E-Mail Address:

---

Specify the amount of computational effort:

• Our greedy heuristic is a randomized algorithm. We execute it several times and return the best equicut found upon the different runs. How many times do you want the greedy heuristic to be run?

  10 Rep.

  100 Rep.

  1000 Rep.

• The basic move of an RRTS heuristic is the iteration. The more iterations we spend, the better solution we obtain. We allow you to choose between 100n, 1000n or 10.000n iterations, where n is the number of nodes of the input graph.

  100 Iter.

  1.000 Iter.

  10.000 Iter.

---

our

RRTS Greedy

heuristic.