Sciweavers

1080 search results - page 8 / 216
» Problem dependent optimization (PDO)
Sort
View
OSN
2007
185views more  OSN 2007»
15 years 3 months ago
Comparison of ILP formulations for the RWA problem
— We present a review of the various integer linear programming (ILP) formulations that have been proposed for the routing and wavelength assignment problem in WDM optical networ...
Brigitte Jaumard, Christophe Meyer, B. Thiongane
AICS
2009
15 years 1 months ago
The Effect of Query Length on Normalisation in Information Retrieval
Document length normalisation is known to be a difficult problem in IR, as tuning is often needed to overcome the collection dependence problem known to affect many normalisation s...
Ronan Cummins, Colm O'Riordan
ESA
2010
Springer
227views Algorithms» more  ESA 2010»
15 years 4 months ago
Approximating Parameterized Convex Optimization Problems
We consider parameterized convex optimization problems over the unit simplex, that depend on one parameter. We provide a simple and efficient scheme for maintaining an -approximat...
Joachim Giesen, Martin Jaggi, Sören Laue
CCE
2011
14 years 7 months ago
Time representations and mathematical models for process scheduling problems
During the last 15 years, many mathematical models have been developed in order to solve process operation scheduling problems, using discrete or continuous time representations. ...
Sylvain Mouret, Ignacio E. Grossmann, Pierre Pesti...
SIAMJO
2010
110views more  SIAMJO 2010»
14 years 10 months ago
Estimating Bounds for Quadratic Assignment Problems Associated with Hamming and Manhattan Distance Matrices Based on Semidefinit
Quadratic assignment problems (QAPs) with a Hamming distance matrix for a hypercube or a Manhattan distance matrix for a rectangular grid arise frequently from communications and ...
Hans D. Mittelmann, Jiming Peng