OL
2016
10 years 21 days ago
2016
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 ...
OL
2016
10 years 21 days ago
2016
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...
OL
2016
10 years 21 days ago
2016
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...
OL
2016
10 years 21 days ago
2016
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 ...
123
click to vote
OL
2016
10 years 21 days ago
2016
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...