Sciweavers

14548 search results - page 253 / 2910
» The Optimal Path-Matching Problem
Sort
View
120
Voted
ATMOS
2008
112views Optimization» more  ATMOS 2008»
15 years 4 months ago
Dynamic Algorithms for Recoverable Robustness Problems
Abstract. Recently, the recoverable robustness model has been introduced in the optimization area. This model allows to consider disruptions (input data changes) in a unified way, ...
Serafino Cicerone, Gabriele Di Stefano, Michael Sc...
102
Voted
4OR
2008
56views more  4OR 2008»
15 years 2 months ago
Exact and approximate resolution of integral multiflow and multicut problems: algorithms and complexity
This is a summary of the author's PhD thesis supervised by Marie-Christine Costa and Fr
Cédric Bentz
148
Voted
NOMS
2006
IEEE
15 years 8 months ago
An Enhanced Estimator to Multi-objective OSPF Weight Setting Problem
— Open Shortest Path First (OSPF) is a routing protocol which is widely used in the Industry. Its functionality mainly depends on the weights assigned to the links. Given the tra...
Mohammed H. Sqalli, Sadiq M. Sait, Mohammed Aijaz ...
JC
2007
94views more  JC 2007»
15 years 2 months ago
On the complexity of the multivariate Sturm-Liouville eigenvalue problem
We study the complexity of approximating the smallest eigenvalue of −∆ + q with Dirichlet boundary conditions on the d-dimensional unit cube. Here ∆ is the Laplacian, and th...
A. Papageorgiou
144
Voted
CP
2005
Springer
15 years 8 months ago
Solving Large-Scale Nonlinear Programming Problems by Constraint Partitioning
Abstract. In this paper, we present a constraint-partitioning approach for finding local optimal solutions of large-scale mixed-integer nonlinear programming problems (MINLPs). Ba...
Benjamin W. Wah, Yixin Chen