#### Filter Results:

- Full text PDF available (5)

#### Publication Year

1996

2015

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Alan J. Soper, Chris Walshaw, Mark Cross
- J. Global Optimization
- 2004

Graph partitioning divides a graph into several pieces by cutting edges. The graph partitioning problem is to divide so that the number of vertices in each piece is the same within some defined tolerance and the number of cut edges separating these pieces is minimised. Important examples of the problem arise in partitioning graphs known as meshes for the… (More)

- Alan J. Soper, Chris Walshaw, Mark Cross
- GECCO
- 2000

Graph partitioning divides a graph into several pieces by cutting edges. The graph partitioning problem is to divide so that the number of vertices in each piece is the same within some defined tolerance and the number of cut edges separating these pieces is minimised. Important examples of the problem arise in partitioning graphs known as meshes for the… (More)

- R C Babbedge, A J Soper, C T Gentry, V C Hood, E A Campbell, L Urban
- Journal of neurophysiology
- 1996

1. We have studied the characteristics of the abnormal properties of damaged myelinated fibers (conduction velocity > 2.0 m/ s) after peripheral nerve injury in a novel in vitro model of the rat sciatic nerve/dorsal root ganglion/dorsal root (L4-5) preparation removed from control naíve or sham-operated rats and animals that had received sciatic neurectomy… (More)

- Alan J. Soper, Vitaly A. Strusevich
- Int. J. Found. Comput. Sci.
- 2007

- Alan J. Soper, Vitaly A. Strusevich
- Discrete Optimization
- 2014

- Alan J. Soper, Vitaly A. Strusevich
- APPROX-RANDOM
- 2014

For a scheduling problem on parallel machines, the power of preemption is defined as the ratio of the makespan of an optimal non-preemptive schedule over the makespan of an optimal preempt-ive schedule. For m uniform parallel machines, we give the necessary and sufficient conditions under which the global bound of 2 − 1/m is tight. If the makespan of the… (More)

- Hans Kellerer, Alan J. Soper, Vitaly A. Strusevich
- COCOA
- 2010

- Carl Crawford, Chris Walshaw, Alan J. Soper
- 2012 16th International Conference on Information…
- 2012

In this paper we discuss an efficiency saving for multilevel force directed placement algorithms. Typically such algorithms use a Barnes Hut octree (or sometimes a grid) in order to approximate global repulsive forces. Here we instead exploit the graph coarsening structure, already in place to facilitate the multilevel scheme, in order to provide a… (More)

- Hans Kellerer, Alan J. Soper, Vitaly A. Strusevich
- J. Comb. Optim.
- 2013

(2013) Preemptive scheduling on two identical parallel machines with a single transporter.

- Demane Rodney, Alan J. Soper, Chris Walshaw
- CSC
- 2008

This paper presents two multilevel refinement algorithms for the capacitated clustering problem. Multilevel refinement is a collaborative technique capable of significantly aiding the solution process for optimisation problems. The central methodologies of the technique are filtering solutions from the search space and reducing the level of problem detail… (More)