A Computational Study of Exact Approaches for the Bi-Objective Prize-Collecting Steiner Tree Problem
- 1 February 2015
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
- Vol. 27 (1) , 118-134
Abstract
No abstract availableKeywords
This publication has 42 references indexed in Scilit:
- Exact approaches for solving robust prize-collecting Steiner tree problemsEuropean Journal of Operational Research, 2013
- Improved Approximation Algorithms for Prize-Collecting Steiner Tree and TSPSIAM Journal on Computing, 2011
- Quantitative Comparison of Approximate Solution Sets for Multicriteria Optimization Problems with Weighted Tchebycheff Preference FunctionOperations Research, 2010
- Solving Connected Subgraph Problems in Wildlife Conservation2010
- An exact -constraint method for bi-objective combinatorial optimization problems: Application to the Traveling Salesman Problem with ProfitsEuropean Journal of Operational Research, 2009
- A relax-and-cut algorithm for the prize-collecting Steiner problem in graphsDiscrete Applied Mathematics, 2009
- On Implementing the Push—Relabel Method for the Maximum Flow ProblemAlgorithmica, 1997
- A note on the prize collecting traveling salesman problemMathematical Programming, 1993
- Bicriteria Transportation ProblemManagement Science, 1979
- Facets of the Knapsack Polytope From Minimal CoversSIAM Journal on Applied Mathematics, 1978