Sciweavers

1963 search results - page 103 / 393
» The Maximum Solution Problem on Graphs
Sort
View
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
16 years 16 days ago
Evolutionary algorithms and matroid optimization problems
We analyze the performance of evolutionary algorithms on various matroid optimization problems that encompass a vast number of efficiently solvable as well as NP-hard combinatoria...
Joachim Reichel, Martin Skutella
ICTAI
2002
IEEE
15 years 11 months ago
Adjusted Network Flow for the Shelf-Space Allocation Problem
In this paper, we study shelf space allocation optimization which is important to retail operations management. Our approach is to formulate a model that is applicable to operatio...
Andrew Lim, Brian Rodrigues, Fei Xiao, Xingwen Zha...
ISAAC
2007
Springer
146views Algorithms» more  ISAAC 2007»
16 years 15 days ago
Bounded Tree-Width and CSP-Related Problems
We study the complexity of structurally restricted homomorphism and constraint satisfaction problems. For every class of relational structures C, let LHOM(C, _) be the problem of d...
Tommy Färnqvist, Peter Jonsson
ICTAI
1996
IEEE
15 years 10 months ago
Applying a Mutation-based Genetic Algorithm to Processor Configuration Problems
The Processor Configuration Problem (PCP) is a Constraint Optimization Problem. The task is to link up a finite set of processors into a network, while minimizing the maximum dist...
T. L. Lau, Edward P. K. Tsang
MP
2008
129views more  MP 2008»
15 years 6 months ago
Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path
Abstract. Two corrector-predictor interior point algorithms are proposed for solving monotone linear complementarity problems. The algorithms produce a sequence of iterates in the ...
Florian A. Potra