14649 search results - page 379 / 2930 » Principles of problem solving |
155
click to vote
EOR
2006
15 years 6 months ago
2006
We develop a multi-objective model for resource allocation problem in PERT networks with exponentially or Erlang distributed activity durations, where the mean duration of each ac...
169
click to vote
EOR
2007
15 years 6 months ago
2007
act 11 We address the problem of designing a network built on several layers. This problem occurs in practical applications 12 but has not been studied extensively from the point o...
155
click to vote
TCBB
2008
15 years 6 months ago
2008
Abstract-- The Maximum Parsimony problem aims at reconstructing a phylogenetic tree from DNA sequences while minimizing the number of genetic transformations. To solve this NP-comp...
194
click to vote
PPSN
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...
224
click to vote
EOR
2010
15 years 4 months ago
2010
We consider the bicriteria scheduling problem of minimizing the number of tardy jobs and average flowtime on a single machine. This problem, which is known to be NP-hard, is impor...