#### Filter Results:

- Full text PDF available (11)

#### Publication Year

1999

2009

- This year (0)
- Last 5 years (0)
- Last 10 years (3)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Balázs Kotnyek
- 2003

The need for more realistic network models led to the development of the dynamic network flow theory. In dynamic flow models it takes time for the flow to pass an arc, the flow can be delayed at nodes, and the network parameters, e.g., the arc capacities, can change in time. Surprisingly perhaps, despite being closer to reality, dynamic flow models have… (More)

- Gautam Appa, Balázs Kotnyek
- Networks
- 2006

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)

- Balázs Kotnyek, Octavio Richetta
- Transportation Science
- 2006

- Gautam Appa, Balázs Kotnyek
- Discrete Mathematics
- 2004

- Tibor Csöndes, Balázs Kotnyek
- Journal of Circuits, Systems, and Computers
- 2002

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 and four different models for the coverage. The test selection problem is… (More)

- Tibor Csöndes, Balázs Kotnyek
- IWTCS
- 1999

- Tibor Csöndes, Sarolta Dibuz, Balázs Kotnyek
- Acta Cybern.
- 1999

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,7] we outlined a new… (More)

- Gautam Appa, Balázs Kotnyek, Konstantinos Papalamprou, Leonidas S. Pitsoulis
- Oper. Res. Lett.
- 2007

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)

- Tibor Csöndes, Balázs Kotnyek, János Zoltán Szabó
- European Journal of Operational Research
- 2002

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)

- András Frank, Zoltán Király, Balázs Kotnyek
- Oper. Res. Lett.
- 2005

A strongly polynomial time algorithm is described to solve the node-capacitated routing problem in an undirected ring network.