Rules/Schemes to select an Entering arc (Literature)
Like Arc block, but considering arcs at
constant intervals (Skip factor).
Arc Sample: Kelly and Neil (1993)
encountered with violation is selected.
First Violated Arc
All non-basic arcs are repriced, and the
most violated arc
Most Violated Arc (1987)
Partitioning trees into
smaller sub trees
, or clusters of vertices. The entering
arc is selected
from the clusters
Clustering Technique, Eppstein
, based on the total number of arcs.
Lobel (2000) 
Based on the
three parameters; (
iteration and. #
to be found in one cluster.
A General Pricing Scheme, Istvan
Based on the ‘
Bradley, Brown and Graves (BBG)
Dividing the arcs into several blocks and choose the most violated arc in a
block at each iteration.
Collect a list of violated arc and choose the best one in the list.