Sciweavers

16404 search results - page 412 / 3281
» A set coverage problem
Sort
View
CEC
2005
IEEE
15 years 8 months ago
DynDE: a differential evolution for dynamic optimization problems
Abstract- This paper presents an approach of using Differential Evolution (DE) to solve dynamic optimization problems. Careful setting of parameters is necessary for DE algorithms ...
Rui Mendes, Arvind S. Mohais
EVOW
2008
Springer
15 years 8 months ago
A Hybrid Column Generation Approach for the Berth Allocation Problem
Abstract. The Berth Allocation Problem (BAP) consists on programming and allocating ships to berthing areas along a quay. The BAP is modeled as a vehicle routing problem and a rece...
Geraldo R. Mauri, Alexandre C. M. Oliveira, Luiz A...
IPCO
2008
129views Optimization» more  IPCO 2008»
15 years 8 months ago
A Polynomial Time Approximation Scheme for the Square Packing Problem
Given a set Q of squares with positive pro ts, the square packing problem is to select and pack a subset of squares of maximum pro t into a rectangular bin R. We present a polynomi...
Klaus Jansen, Roberto Solis-Oba
WOTUG
2008
15 years 8 months ago
Solving the Santa Claus Problem: a Comparison of Various Concurrent Programming Techniques
Abstract. The Santa Claus problem provides an excellent exercise in concurrent programming and can be used to show the simplicity or complexity of solving problems using a particul...
Jason Hurt, Jan Bækgaard Pedersen
ALGORITHMICA
2010
141views more  ALGORITHMICA 2010»
15 years 6 months ago
Parameterized Complexity and Local Search Approaches for the Stable Marriage Problem with Ties
Abstract. We consider the variant of the classical Stable Marriage problem where preference lists can be incomplete and may contain ties. In such a setting, finding a stable matchi...
Dániel Marx, Ildikó Schlotter