#### Filter Results:

#### Publication Year

1999

2009

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

We define binet matrices, which furnish a direct generalization of totally unimodular network matrices and arise from the node-edge incidence matrices of bidirected graphs in the same way as the network matrices do from directed graphs. We develop the necessary theory, give binet representations for interesting sets of matrices, characterize totally… (More)

This paper deals with linear and integer programming problems in which the constraint matrix is a binet matrix. Binet matrices are pivoted versions of the node-edge incidence matrices of bidirected graphs. It is shown that efficient methods are available to solve such optimization problems. Linear programs can be solved with the generalized network simplex… (More)

Conformance testing is based on a test suite. Standardization committees release standard test suites, which consist of hundreds of test cases. The main problem of conformance testing is that we do not have enough time to execute them all. Therefore, test selection is required to maximize the test coverage. In our earlier papers 6,77 we outlined a new… (More)

In this paper we focus on the test selection problem. It is modeled after a real-life problem that arises in telecommunication when one has to check the reliability of an application. We apply different metaheuristics, namely Reactive Tabu Search (RTS), Genetic Algorithms (GA) and Simulated Annealing (SA) to solve the problem. We propose some modifications… (More)

Received (received date) Revised (revised date) Accepted (accepted date) This paper presents a mathematical model for the test selection problem in protocol conformance testing, the goal of which is to select a suitable test set from a given test suite. The problem is described together with its mathematical formulation including two optimization problems… (More)

Seymour's famous decomposition theorem for regular matroids states that any totally unimodular (TU) matrix can be constructed through a series of composition operations called k-sums starting from network matrices and their transposes and two compact representation matrices B1, B2 of a certain ten element matroid. Given that B1, B2 are binet matrices we… (More)

- ‹
- 1
- ›