#### Filter Results:

- Full text PDF available (6)

#### Publication Year

2014

2017

- This year (2)
- Last 5 years (6)
- Last 10 years (6)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Zhang-Hua Fu, Jin-Kao Hao
- INFORMS Journal on Computing
- 2015

Authors are encouraged to submit new papers to INFORMS journals by means of a style file template, which includes the journal title. However, use of a template does not certify that the paper has been accepted for publication in the named journal. INFORMS journal templates are for the exclusive purpose of submitting to an INFORMS journal and should not be… (More)

- Zhang-Hua Fu, Jin-Kao Hao
- European Journal of Operational Research
- 2014

The Steiner tree problem (STP) is one of the most popular combinatorial optimization problems with various practical applications. In this paper, we propose a Breakout Local Search (BLS) algorithm for an important generalization of the STP: the Steiner tree problem with revenue, budget and hop constraints (STPRBH), which consists of determining a subtree of… (More)

- Zhang-Hua Fu, Jin-Kao Hao
- Eng. Appl. of AI
- 2015

Given an undirected graph with costs associated with each edge as well as each pair of edges, the quadratic minimum spanning tree problem (QMSTP) consists of determining a spanning tree of minimum cost. QMSTP is useful to model many reallife network design applications. We propose a three-phase search approach named TPS for solving QMSTP, which organizes… (More)

- Zhang-Hua Fu
- 2014

Given an undirected graph with prizes associated with its vertices and costs associated with its edges, the prize-collecting Steiner tree problem in graphs (PCSPG) consists of finding a subtree of this graph, so as to minimize the sum of the costs of its edges plus the prizes of the vertices not spanned. In this paper, we propose a knowledge guided tabu… (More)

- Zhang-Hua Fu, Jin-Kao Hao
- Math. Program. Comput.
- 2017

Steiner tree problems (STPs) are very important in both theory and practice. In this paper, we introduce a powerful swap-vertex move operator which can be used as a basic element of any neighborhood search heuristic to solve many STP variants. Given the incumbent solution tree T , the swapvertex move operator exchanges a vertex in T with another vertex out… (More)

- Zhang-Hua Fu, Jin-Kao Hao
- Knowl.-Based Syst.
- 2017

The prize-collecting Steiner tree problem in graphs (PCSPG), as well as its rooted variant (RPCST), are target problems of the 11th DIMACS (the Center for Discrete Mathematics and Theoretical Computer Science) Implementation Challenge held in collaboration with ICERM (the Institute for Computational and Experimental Research in Mathematics). To solve these… (More)

- ‹
- 1
- ›