Sciweavers

3142 search results - page 152 / 629
» Solving Hierarchical Optimization Problems Using MOEAs
Sort
View
124
Voted
GECCO
2007
Springer
167views Optimization» more  GECCO 2007»
15 years 9 months ago
Genetically designed heuristics for the bin packing problem
The bin packing problem (BPP) is a real-world problem that arises in different industrial applications related to minimization of space or time. The aim of this research is to au...
Oana Muntean
ICML
2005
IEEE
16 years 4 months ago
Implicit surface modelling as an eigenvalue problem
We discuss the problem of fitting an implicit shape model to a set of points sampled from a co-dimension one manifold of arbitrary topology. The method solves a non-convex optimis...
Christian Walder, Olivier Chapelle, Bernhard Sch&o...
114
Voted
EOR
2006
78views more  EOR 2006»
15 years 3 months ago
A multi-objective resource allocation problem in PERT networks
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...
Amir Azaron, Hideki Katagiri, Masatoshi Sakawa, Ko...
EOR
2010
104views more  EOR 2010»
15 years 24 days ago
New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs
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...
Fatih Safa Erenay, Ihsan Sabuncuoglu, Aysegül...
136
Voted
EVOW
2007
Springer
15 years 9 months ago
A Probabilistic Beam Search Approach to the Shortest Common Supersequence Problem
The Shortest Common Supersequence Problem (SCSP) is a well-known hard combinatorial optimization problem that formalizes many real world problems. This paper presents a novel rando...
Christian Blum, Carlos Cotta, Antonio J. Fern&aacu...