Sciweavers

1576 search results - page 47 / 316
» Properties of Synthetic Optimization Problems
Sort
View
IPCO
2008
221views Optimization» more  IPCO 2008»
13 years 11 months ago
A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...
Michael Armbruster, Marzena Fügenschuh, Chris...
JMLR
2010
125views more  JMLR 2010»
13 years 4 months ago
Variational Relevance Vector Machine for Tabular Data
We adopt the Relevance Vector Machine (RVM) framework to handle cases of tablestructured data such as image blocks and image descriptors. This is achieved by coupling the regulari...
Dmitry Kropotov, Dmitry Vetrov, Lior Wolf, Tal Has...
CPAIOR
2005
Springer
14 years 3 months ago
Shorter Path Constraints for the Resource Constrained Shortest Path Problem
Abstract. Recently, new cost-based filtering algorithms for shorter-path constraints have been developed. However, so far only the theoretical properties of shorter-path constrain...
Thorsten Gellermann, Meinolf Sellmann, Robert Wrig...
EC
1998
100views ECommerce» more  EC 1998»
13 years 9 months ago
Genetic Forma Recombination in Permutation Flowshop Problems
This paper analyzes different representations for permutation flowshop problems. This is done using forma analysis to assess the quality of these representations with respect to m...
Carlos Cotta, José M. Troya
SIAMNUM
2011
139views more  SIAMNUM 2011»
13 years 4 months ago
Adaptive Wavelet Schemes for Parabolic Problems: Sparse Matrices and Numerical Results
A simultaneous space-time variational formulation of a parabolic evolution problem is solved with an adaptive wavelet method. This method is shown to converge with the best possibl...
Nabi Chegini, Rob Stevenson