Sciweavers

928 search results - page 4 / 186
» Evolutionary algorithms and matroid optimization problems
Sort
View
EMO
2009
Springer
190views Optimization» more  EMO 2009»
14 years 2 months ago
Solving Bilevel Multi-Objective Optimization Problems Using Evolutionary Algorithms
Abstract. Bilevel optimization problems require every feasible upperlevel solution to satisfy optimality of a lower-level optimization problem. These problems commonly appear in ma...
Kalyanmoy Deb, Ankur Sinha
ESA
2009
Springer
109views Algorithms» more  ESA 2009»
14 years 2 months ago
Iterative Rounding for Multi-Objective Optimization Problems
In this paper we show that iterative rounding is a powerful and flexible tool in the design of approximation algorithms for multiobjective optimization problems. We illustrate tha...
Fabrizio Grandoni, R. Ravi, Mohit Singh
EMO
2001
Springer
225views Optimization» more  EMO 2001»
14 years 5 days ago
Application of Multiobjective Evolutionary Algorithms for Dose Optimization Problems in Brachytherapy
In High Dose Rate (HDR) brachytherapy the conventional dose optimization algorithms consider the multiple objectives in form of an aggregate function which combines individual obj...
Michael Lahanas, Natasa Milickovic, Dimos Baltas, ...
STOC
2009
ACM
163views Algorithms» more  STOC 2009»
14 years 8 months ago
Non-monotone submodular maximization under matroid and knapsack constraints
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hy...
Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, M...
APPROX
2009
Springer
138views Algorithms» more  APPROX 2009»
14 years 2 months ago
Submodular Maximization over Multiple Matroids via Generalized Exchange Properties
Submodular-function maximization is a central problem in combinatorial optimization, generalizing many important NP-hard problems including Max Cut in digraphs, graphs and hypergr...
Jon Lee, Maxim Sviridenko, Jan Vondrák