Martin A.

A. Martin

Information about the author A. Martin will soon be added to the site.
Found 12 papers in total
Solving Steiner tree problems in graphs to optimality
Solving Steiner tree problems in graphs to optimality
1998
In this paper, we present the implementation of a branch-and-cut algorithm for solving...
An integrated introduction to spreadsheet and programming skills for operational research students
An integrated introduction to spreadsheet and programming skills for operational research students
2000
Spreadsheets and computer programming make valuable contributions to OR courses. The...
A simulation engine for custom project management education
A simulation engine for custom project management education
2000
The Project Management Simulation Engine is a software environment for generating...
The node capacitated graph partitioning problem: A computational study
The node capacitated graph partitioning problem: A computational study
1998
In this paper we consider the problem of k -partitioning the nodes of a graph with...
The Steiner tree packing problem in VLSI design
The Steiner tree packing problem in VLSI design
1997
In this paper we describe several versions of the routing problem arising in VLSI...
Frequency assignment in cellular phone networks
Frequency assignment in cellular phone networks
1998
We present a graph-theoretic model for the frequency assignment problem in cellular...
Formulations and valid inequalities for the node capacitated graph partitioning problem
Formulations and valid inequalities for the node capacitated graph partitioning problem
1996
We investigate the problem of partitioning the nodes of a graph under capacity...
Packing Steiner trees: Polyhedral investigations
Packing Steiner trees: Polyhedral investigations
1996
Let G=(V,E) be a graph and T⊆V be a node set. The authors call an edge set S a...
Packing Steiner trees: A cutting plane algorithnm and computational results
Packing Steiner trees: A cutting plane algorithnm and computational results
1996
In this paper the authors describe a cutting plane algorithm for the Steiner tree...
Routing in grid graphs by cutting planes
Routing in grid graphs by cutting planes
1995
In this paper the authors study the following problem, which they call the weighted...
Quadratic 0/1 optimization and a decomposition approach for the placement of electronic circuits
Quadratic 0/1 optimization and a decomposition approach for the placement of electronic circuits
1994
The placement problem in the layout design of electronic circuits consists of finding...
Some integer programs arising in the design of main frame computers
Some integer programs arising in the design of main frame computers
1993
In this paper the authors describe and discuss a problem that arises in the (global)...
Papers per page: