MengChang Wang

5 Questions 11 Answers 0 Followers

Questions related from MengChang Wang

Is there any methodology able to efficiently solve large NP-hard problems approximately?

Meta-heuristics (SA, GA, PSO, etc) are usually used to solve large problems approximately or near-optimally. However the efficiency of this method is often impractical for real-world projects,...

14 May 2014 9,582 3 View

What's the fundamental difference between robust optimization and chance-constrained optimization?

Robust optimization can have good solution for a system in even extreme conditions. However, these extreme situations do not always/often happen. Chance-constrained optimization can have good...

10 October 2013 5,206 0 View

Do you still agree with those "future research suggestions " in you own articles that were published years ago?

Various reasons lead those suggestions to no end. If you have these suggestions, do you still agree with them? Why did you stop continuing the research on them?

04 June 2013 256 1 View

Do you agree with that Artificial Neural Networks are able to approximate discrete functions?

Continuous functions can be approximated by ANN effectively, which is proved both in theory and practice, as well as the discrete version of these continuous functions. However, there is a kind...

23 April 2013 8,076 5 View

Is a Multi-level CLSP able to be decomposed into several Single-level CLSP ?

As far as I know, a single-level CLSP is an NP-hard problem. Multi-level CLSPs are more complex than single-level ones. What is the main strategy in solving a Multi-level CLSP? What's the...

26 March 2013 4,499 1 View