New best solutions for the graph bisection problem

These solutions have been found by using the PROBE metaheuristic. Please quote the following paper:

P. Chardaire, M. Barake, and G.P. McKeown,
"A PROBE based heuristic for Graph Partitioning",
Submitted to IEEE Transactions on Computers.
Pdf version: gbprevised2col.pdf.

Instance	Cut Value	Link to file
add20	596	add20_596.
data	189	data_189.
memplus	5513	memplus_5513.
bcsstk31	2762	bcsstk31_2762.
fe_rotor	2098	fe_rotor_2098.
598a	2398	598a_2398.
fe_ocean	464	fe_ocean_464.
144	6490	144_6490.
wave	8692	wave_8692.
auto	10117	auto_10117.

My Ph.D.

P. Chardaire, (1998),
"Facility Location Optimization and Cooperative Games"
Ph.d., School of Information Systems, University of East-Anglia, Norwich NR4 7TJ, UK.
my Ph.D. page.

School of
Information Systems
UEA, Norwich,
NR4 7TJ, UK.