The following pages link to (Q3137900):
Displayed 28 items.
- Spherical coverage verification (Q440948) (← links)
- New formulations of the multiple sequence alignment problem (Q628651) (← links)
- An improved column generation algorithm for minimum sum-of-squares clustering (Q662300) (← links)
- Two-stage robust LP with ellipsoidal right-hand side uncertainty is NP-hard (Q694182) (← links)
- Monte-Carlo-type techniques for processing interval uncertainty, and their potential engineering applications (Q858161) (← links)
- Ellipsoids and ellipsoid-shaped fuzzy sets as natural multi-variate generalization of intervals and fuzzy numbers: how to elicit them from users, and how to use them in data processing (Q867624) (← links)
- The complexity of optimizing over a simplex, hypercube or sphere: a short survey (Q940826) (← links)
- A fast memoryless interval-based algorithm for global optimization (Q975771) (← links)
- Quadratic programming and combinatorial minimum weight product problems (Q985315) (← links)
- Fast suboptimal predictive control with guaranteed stability (Q1275060) (← links)
- A polyhedral study of nonconvex quadratic programs with box constraints (Q1774169) (← links)
- Rigorous convex underestimators for general twice-differentiable problems (Q1817315) (← links)
- A storm of feasibility pumps for nonconvex MINLP (Q1925794) (← links)
- On-line algorithms for computing mean and variance of interval data, and their use in intelligent systems (Q2372221) (← links)
- Using expert knowledge in solving the seismic inverse problem (Q2382784) (← links)
- On a decision procedure for quantified linear programs (Q2462634) (← links)
- 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)
- A continuous approch for globally solving linearly constrained quadratic (Q2767579) (← 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)
- (Q4240645) (← 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)