A web-based multi-optimisation approach for convergent product networks using the Steiner tree
暂无分享,去创建一个
Iraj Mahdavi | Nezam Mahdavi-Amiri | Reza Hassanzadeh | N. Mahdavi-Amiri | R. Hassanzadeh | I. Mahdavi
[1] S. Louis Hakimi,et al. Steiner's problem in graphs and its implications , 1971, Networks.
[2] S. E. Dreyfus,et al. The steiner problem in graphs , 1971, Networks.
[3] Yacov Y. Haimes,et al. Multiobjective Decision Making: Theory and Methodology , 1983 .
[4] David S. Johnson. The NP-Completeness Column: An Ongoing Guide , 1986, J. Algorithms.
[5] Victor J. Rayward-Smith,et al. On finding steiner vertices , 1986, Networks.
[6] Kurt Mehlhorn,et al. A Faster Approximation Algorithm for the Steiner Problem in Graphs , 1988, Inf. Process. Lett..
[7] J. E. Beasley. An SST-based algorithm for the steiner problem in graphs , 1989, Networks.
[8] A. Volgenant,et al. Reduction tests for the steiner problem in grapsh , 1989, Networks.
[9] Dana S. Richards,et al. Steiner tree problems , 1992, Networks.
[10] G. D. Smith,et al. Solving the Graphical Steiner Tree Problem Using Genetic Algorithms , 1993 .
[11] Henrik Esbensen,et al. Computing near-optimal solutions to the steiner problem in a graph using a genetic algorithm , 1995, Networks.
[12] Lorraine R. Gardiner,et al. A Bibliographic Survey of the Activities and International Nature of Multiple Criteria Decision Making , 1996 .
[13] Celso C. Ribeiro,et al. Greedy randomized adaptive search procedures for the Steiner problem in graphs. , 1997 .
[14] T. Koch,et al. Solving Steiner Tree Problems in Graphs to Optimality , 1998 .
[15] Celso C. Ribeiro,et al. Improved Tabu Search For The Steiner Problem In Graphs , 2000 .
[16] Kaisa Miettinen,et al. Nonlinear multiobjective optimization , 1998, International series in operations research and management science.
[17] Celso C. Ribeiro,et al. A Parallel GRASP for the Steiner Problem in Graphs , 1998, IRREGULAR.
[18] Alex Zelikovsky,et al. Improved Steiner tree approximation in graphs , 2000, SODA '00.
[19] Celso C. Ribeiro,et al. A Parallel Grasp for the Steiner Tree Problem in Graphs Using a Hybrid Local Search Strategy , 2000, J. Glob. Optim..
[20] Giuseppe Di Fatta,et al. A parallel genetic algorithm for the Steiner Problem in Networks , 2003 .
[21] Xavier Gandibleux,et al. Multiobjective Combinatorial Optimization — Theory, Methodology, and Applications , 2003 .
[22] George Markowsky,et al. A fast algorithm for Steiner trees , 1981, Acta Informatica.
[23] J. Callahan,et al. The Importance of Customer Input in the Development of Very New Products , 2004 .
[24] Pawel Winter,et al. Path-distance heuristics for the Steiner problem in undirected networks , 1992, Algorithmica.
[25] Alex Zelikovsky,et al. Tighter Bounds for Graph Steiner Tree Approximation , 2005, SIAM J. Discret. Math..
[26] Serpil Sayin,et al. The Multiobjective Discrete Optimization Problem: A Weighted Min-Max Two-Stage Optimization Approach and a Bicriteria Algorithm , 2005, Manag. Sci..
[27] Alysson M. Costa,et al. Steiner Tree Problems With Profits , 2006 .
[28] Marco Laumanns,et al. An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method , 2006, Eur. J. Oper. Res..
[29] Serpil Sayin,et al. Algorithm robust for the bicriteria discrete optimization problem , 2006, Ann. Oper. Res..
[30] Margaret M. Wiecek,et al. An improved algorithm for solving biobjective integer programs , 2006, Ann. Oper. Res..
[31] Nicolas Jozefowiez,et al. The bi-objective covering tour problem , 2007, Comput. Oper. Res..
[32] Birgit Verworn,et al. The Fuzzy Front End of Japanese New Product Development Projects: Impact on Success and Differences between Incremental and Radical Projects , 2007 .
[33] Tripat Gill,et al. Convergence in the high-technology consumer markets: Not all brands gain equally from adding new functionalities to products , 2009 .
[34] Tripat Gill,et al. Convergent Products: What Functionalities Add More Value to the Base? , 2008 .
[35] Danny Segev,et al. A polylogarithmic approximation for computing non-metric terminal Steiner trees , 2010, Inf. Process. Lett..
[36] Matthias Müller-Hannemann,et al. A near linear time approximation scheme for Steiner tree among obstacles in the plane , 2010, Comput. Geom..
[37] David Pritchard,et al. Integrality gap of the hypergraphic relaxation of Steiner trees: A short proof of a 1.55 upper bound , 2010, Oper. Res. Lett..
[38] Cevahir Uzkurt,et al. Customer participation in the service process: a model and research propositions , 2010 .
[39] Pauliina Ulkuniemi,et al. Creating value for the business service buyer through modularity , 2011 .
[40] Anna Zych,et al. New Reoptimization Techniques applied to Steiner Tree Problem , 2011, Electron. Notes Discret. Math..
[41] Xiao-xu Lu,et al. Location-selection of Wireless Network Based on Restricted Steiner Tree Algorithm , 2011 .
[42] Markus Chimani,et al. Improved Steiner tree algorithms for bounded treewidth , 2012, J. Discrete Algorithms.
[43] Yongtae Park,et al. Design of convergent product concepts based on functionality: An association rule mining and decision tree approach , 2012, Expert Syst. Appl..
[44] Y. Migdadi. The order winners’ operations strategy of mobile phone service providers in developing economies: the case of Jordan , 2012 .