Sciweavers

Share
OL
2016
70views more  OL 2016»
3 years 6 months ago
Some applications of polynomial optimization in operations research and real-time decision making
We demonstrate applications of algebraic techniques that optimize and certify polynomial inequalities to problems of interest in the operations research and transportation enginee...
Amir Ali Ahmadi, Anirudha Majumdar
OL
2016
65views more  OL 2016»
3 years 6 months ago
On the optimal order of worst case complexity of direct search
The worst case complexity of direct-search methods has been recently analyzed when they use positive spanning sets and impose a sufficient decrease condition to accept new iterate...
M. Dodangeh, Luís N. Vicente, Z. Zhang
OL
2016
61views more  OL 2016»
3 years 6 months ago
OMEGA one multi ethnic genetic approach
Carmine Cerrone, Raffaele Cerulli, Manlio Gaudioso
OL
2016
62views more  OL 2016»
3 years 6 months ago
On the coupled continuous knapsack problems: projection onto the volume constrained Gibbs N-simplex
Coupled continuous quadratic knapsack problems (CCK) are introduced in the present study. The solution of a CCK problem is equivalent to the projection of an arbitrary point onto t...
Rouhollah Tavakoli
OL
2016
60views more  OL 2016»
3 years 6 months ago
Strong duality in Lasserre's hierarchy for polynomial optimization
A polynomial optimization problem (POP) consists of minimizing a multivariate real polynomial on a semi-algebraic set K described by polynomial inequalities and equations. In its ...
Cédric Josz, Didier Henrion
OL
2016
72views more  OL 2016»
3 years 6 months ago
Computational performance evaluation of two integer linear programming models for the minimum common string partition problem
In the minimum common string partition (MCSP) problem two related input strings are given. “Related” refers to the property that both strings consist of the same set of letters...
Christian Blum, Günther R. Raidl
OL
2016
62views more  OL 2016»
3 years 6 months ago
Approximating the minimum hub cover problem on planar graphs
We study an approximation algorithm with a performance guarantee to solve a new NP-hard optimization problem on planar graphs. The problem, which is referred to as the minimum hub...
Belma Yelbay, S. Ilker Birbil, Kerem Bülb&uum...
OL
2016
71views more  OL 2016»
3 years 6 months ago
A derivative-free approach for a simulation-based optimization problem in healthcare
Hospitals have been challenged in recent years to deliver high quality care with limited resources. Given the pressure to contain costs, developing procedures for optimal resource ...
Stefano Lucidi, Massimo Maurici, Luca Paulon, Fran...
OL
2016
85views more  OL 2016»
3 years 6 months ago
An improved bound for the Lyapunov rank of a proper cone
Given a proper cone K in Rn with its dual K∗ , the complementarity set of K is C (K) := {(x, s) : x ∈ K, s ∈ K∗ , x, s = 0}. A matrix A on Rn is said to be Lyapunov-like on...
Michael Orlitzky, M. Seetharama Gowda
books