Sciweavers

1289 search results - page 73 / 258
» Complexity of Counting the Optimal Solutions
Sort
View
MOR
2006
95views more  MOR 2006»
14 years 9 months ago
An Efficient Interior-Point Method for Convex Multicriteria Optimization Problems
In multicriteria optimization, several objective functions, conflicting with each other, have to be minimized simultaneously. We propose a new efficient method for approximating t...
Jörg Fliege
EMO
2006
Springer
144views Optimization» more  EMO 2006»
15 years 1 months ago
Evolutionary Multiobjective Optimization of Steel Structural Systems in Tall Buildings
This paper presents results of extensive computational experiments in which evolutionary multiobjective algorithms were used to find Pareto-optimal solutions to a complex structura...
Rafal Kicinger, Shigeru Obayashi, Tomasz Arciszews...
CPAIOR
2007
Springer
15 years 4 months ago
Connections in Networks: Hardness of Feasibility Versus Optimality
We study the complexity of combinatorial problems that consist of competing infeasibility and optimization components. In particular, we investigate the complexity of the connectio...
Jon Conrad, Carla P. Gomes, Willem Jan van Hoeve, ...
CVPR
2005
IEEE
15 years 12 months ago
Optimal Sub-Shape Models by Minimum Description Length
Active shape models are a powerful and widely used tool to interpret complex image data. By building models of shape variation they enable search algorithms to use a priori knowle...
Georg Langs, Philipp Peloschek, Horst Bischof
COR
2008
111views more  COR 2008»
14 years 10 months ago
An optimization algorithm for the inventory routing problem with continuous moves
The typical inventory routing problem deals with the repeated distribution of a single product from a single facility with an unlimited supply to a set of customers that can all b...
Martin W. P. Savelsbergh, Jin-Hwa Song