org.jacop.constraints.netflow.simplex

Class Danzig

java.lang.Object

org.jacop.constraints.netflow.simplex.Danzig

All Implemented Interfaces:

PivotRule

public class Danzig
extends Object
implements PivotRule

A simple rule that always chooses the arc with maximum violation. It minimizes the number of iterations but the computational overhead might be large.

Version:

4.9

Author:

Robin Steiger and Radoslaw Szymanek

Field Summary

Fields

Modifier and Type	Field and Description
NetworkSimplex	network

Constructor Summary

Constructors

Constructor and Description
Danzig(NetworkSimplex network)

Method Summary

Modifier and Type	Method and Description
Arc	next() Finds the lower arc which violates optimality the most (If all lower arcs satisfy optimality then all upper arcs do too.
void	reset()

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

network

public NetworkSimplex network

Constructor Detail

Danzig

public Danzig(NetworkSimplex network)

Method Detail

next

public Arc next()

Finds the lower arc which violates optimality the most (If all lower arcs satisfy optimality then all upper arcs do too. In this case null is returned)

Specified by:

next in interface PivotRule

reset

public void reset()

Specified by:

reset in interface PivotRule