A test problem generator for the Steiner problem in graphs

Authors:
B. N. Khoury;P. M. Pardalos;D.-Z. Du
Affiliations:
-;-;-
Venue:
ACM Transactions on Mathematical Software (TOMS)
Year:
1993

Citing 8
Cited 7

A faster approximation algorithm for the Steiner problem in graphs

Acta Informatica
Steiner problem in networks: a survey

Networks
Integer and combinatorial optimization

Integer and combinatorial optimization
Combinatorial algorithms for integrated circuit layout

Combinatorial algorithms for integrated circuit layout
On the complexity of test case generation for NP-hard problems

Information Processing Letters
Construction of test problems in quadratic bivalent programming

ACM Transactions on Mathematical Software (TOMS)
Generation of large-scale quadratic programs for use as global optimization test problems

ACM Transactions on Mathematical Software (TOMS)
Pracniques: construction of nonlinear programming test problems

Communications of the ACM

Experimental Evaluation of Heuristic Optimization Algorithms: A Tutorial

Journal of Heuristics
Test Functions with Variable Attraction Regions for GlobalOptimization Problems

Journal of Global Optimization
Algorithm 829: Software for generation of classes of test functions with known local and global minima for global optimization

ACM Transactions on Mathematical Software (TOMS)
A survey of combinatorial optimization problems in multicast routing

Computers and Operations Research
Study of multiscale global optimization based on parameter space partition

Journal of Global Optimization
A node splitting technique for two level network design problems with transition nodes

INOC'11 Proceedings of the 5th international conference on Network optimization
The two level network design problem with secondary hop constraints

INOC'11 Proceedings of the 5th international conference on Network optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present a new binary-programming formulation for the Steiner problem in graphs (SPG), which is well known to be NP-hard. We use this formulation to generate test problems with known optimal solutions. The technique uses the KKT optimality conditions on the corresponding quadratically constrained optimization problem.