Pages that link to "Item:Q925234"
From MaRDI portal
The following pages link to Infeasibility spheres for finding robust solutions of blending problems with quadratic constraints (Q925234):
Displaying 6 items.
- Locating a competitive facility in the plane with a robustness criterion (Q421609) (← links)
- Pareto optimality and robustness in bi-blending problems (Q458955) (← links)
- On determining the cover of a simplex by spheres centered at its vertices (Q645552) (← links)
- On a branch-and-bound approach for a Huff-like Stackelberg location problem (Q1027988) (← links)
- On parallel branch and bound frameworks for global optimization (Q1683320) (← links)
- Simplicial Lipschitz optimization without the Lipschitz constant (Q2249819) (← links)