#### Filter Results:

- Full text PDF available (5)

#### Publication Year

1996

2017

- This year (1)
- Last 5 years (6)
- Last 10 years (9)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

#### Organism

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)

- R C Babbedge, Alan J. Soper, Clive Gentry, Vivienne C Hood, Elizabeth A. Campbell, Laszlo 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, 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)

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

- 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 preemptive 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)

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

- Alan J. Soper
- J. Scheduling
- 2015

- Leah Epstein, Asaf Levin, Alan J. Soper, Vitaly A. Strusevich
- SIAM J. Discrete Math.
- 2017

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

We study the two-machine flow shop problem with an uncapacitated interstage transporter. The jobs have to be split into batches, and upon completion on the first machine, each batch has to be shipped to the second machine by a transporter. The best known heuristic for the problem is a |—approximation algorithm that outputs a two-shipment schedule. We design… (More)

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

We consider a scheduling problem on two identical parallel machines, in which the jobs are moved between the machines by an uncapacitated transporter. In the processing preemption is allowed. The objective is to minimize the time by which all completed jobs are collected together on board the transporter. We identify the structural patterns of an optimal… (More)