The following pages link to (Q3137900):
Displaying 21 items.
- A polynomial time algorithm for Zero-Clairvoyant scheduling (Q2475435) (← links)
- Computing population variance and entropy under interval uncertainty: Linear-time algorithms (Q2481140) (← links)
- Outlier detection under interval uncertainty: algorithmic solvability and computational complexity (Q2484030) (← links)
- Exact bounds on finite populations of interval data (Q2484079) (← links)
- A hybrid genetic algorithm for the finite horizon economic lot and delivery scheduling in supply chains (Q2491781) (← links)
- Computing mean and variance under Dempster-Shafer uncertainty: towards faster algorithms (Q2506950) (← links)
- Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization (Q2515043) (← links)
- A continuous approch for globally solving linearly constrained quadratic (Q2767579) (← links)
- Nonconvex Phase Synchronization (Q2832892) (← links)
- Exact and Heuristic Algorithms for Semi-Nonnegative Matrix Factorization (Q3195441) (← links)
- Canonical Duality Theory: Connections between Nonconvex Mechanics and Global Optimization (Q3565467) (← links)
- Estimating information amount under uncertainty: algorithmic solvability and computational complexity (Q3577034) (← links)
- How to divide a territory? A new simple differential formalism for optimization of set functions (Q4240645) (← links)
- Nonlinear material decomposition using a regularized iterative scheme based on the Bregman distance (Q4555029) (← links)
- A strongly polynomial algorithm for a new class of linear inequalities<sup>1</sup> (Q4836755) (← links)
- Structured singular value controller synthesis using constant <i>D</i>-scales without <i>D-K</i> iteration (Q4876794) (← links)
- DC Programming and DCA for Challenging Problems in Bioinformatics and Computational Biology (Q4983006) (← links)
- Enclosing the solution set of the parametric generalised Sylvester matrix equation <i>A</i>(<i>p</i>)<i>XB</i>(<i>p</i>) + <i>C</i>(<i>p</i>)<i>XD</i>(<i>p</i>) = <i>F</i>(<i>p</i>) (Q5026867) (← links)
- Cubature, Approximation, and Isotropy in the Hypercube (Q5348327) (← links)
- A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem (Q5867624) (← links)
- Tensors in computations (Q5887832) (← links)
