The following pages link to Eduardo Conde (Q228561):
Displaying 45 items.
- On a constant factor approximation for minmax regret problems using a symmetry point scenario (Q439704) (← links)
- On the gravity dual of Chern-Simons-matter theories with unquenched flavor (Q467228) (← links)
- On the holographic dual of \( \mathcal{N} = 1 \) SQCD with massive flavors (Q489651) (← links)
- Kutasov-like duality from D5-branes wrapping hyperbolic cycles (Q545246) (← links)
- BMS supertranslations and not so soft gravitons (Q682949) (← links)
- A minmax regret version of the time-dependent shortest path problem (Q724002) (← links)
- Erratum: On the holographic dual of \( \mathcal{N} = 1\) SQCD with massive flavors (Q737499) (← links)
- Unquenched massive flavors and flows in Chern-Simons matter theories (Q737846) (← links)
- (Q857942) (redirect page) (← links)
- Inferring efficient weights from pairwise comparison matrices (Q857943) (← links)
- Minmax regret location--allocation problem on a network under uncertainty (Q864020) (← links)
- A branch and bound algorithm for the minimax regret spanning arborescence (Q878227) (← links)
- Minimax regret spanning arborescences under uncertain costs (Q881514) (← links)
- A note on the minmax regret centdian location on trees (Q935247) (← links)
- A 2-approximation for minmax regret problems via a mid-point scenario optimal solution (Q991475) (← links)
- A minmax regret approach to the critical path method with task interval times (Q1011286) (← links)
- A linear optimization problem to derive relative weights using an interval judgement matrix (Q1037681) (← links)
- Multi-criteria analysis with partial information about the weighting coefficients (Q1129899) (← links)
- Maximin location: Discretization not always works (Q1284606) (← links)
- Semi-obnoxious location models: A global optimization approach (Q1291602) (← links)
- Efficiency in Euclidean constrained location problems (Q1318667) (← links)
- Mean utility in the assurance region model (Q1600975) (← links)
- Robust minmax regret combinatorial optimization problems with a resource-dependent uncertainty polyhedron of scenarios (Q1634058) (← links)
- Spinor-helicity three-point amplitudes from local cubic interactions (Q1639011) (← links)
- Lorentz constraints on massive three-point amplitudes (Q1639167) (← links)
- A minimum expected regret model for the shortest path problem with solution-dependent probability distributions (Q1652010) (← links)
- Minmax regret combinatorial optimization problems with investments (Q1652341) (← links)
- Finding GM-estimators with global optimization techniques (Q1850824) (← links)
- An improved algorithm for selecting \(p\) items with uncertain returns according to the minmax-regret criterion (Q1881565) (← links)
- Planar point-objecitve location problems with nonconvex constraints: A geometrical construction (Q1890946) (← links)
- Pareto-optimality in linear regression (Q1892523) (← links)
- A relative robust approach on expected returns with bounded CVaR for portfolio selection (Q2239973) (← links)
- A minmax regret linear regression model under uncertainty in the dependent variable (Q2251555) (← links)
- On the tree-level structure of scattering amplitudes of massless particles (Q2261134) (← links)
- A tale of two cascades: Higgsing and Seiberg-duality cascades from type IIB string theory (Q2340537) (← links)
- A MIP formulation for the minmax regret total completion time in scheduling with unrelated parallel machines (Q2448222) (← links)
- A minmax regret median problem on a tree under uncertain locations of the demand points (Q2450737) (← links)
- Holographic duals of SQCD models in low dimensions (Q2452511) (← links)
- On the complexity of the continuous unbounded knapsack problem with uncertain coefficients (Q2488199) (← links)
- A robust optimization model for distribution network design under a mixed integer set of scenarios (Q2669596) (← links)
- Admission Policies in Loss Queueing Models with Heterogeneous Arrivals (Q2783924) (← links)
- Simpson Points in Planar Problems with Locational Constraints. The Round-Norm Case (Q4346223) (← links)
- Simpson Points in Planar Problems with Locational Constraints. The Polyhedral-Gauge Case (Q4346224) (← links)
- The generalized Weber problem with expected distances (Q4837960) (← links)
- An optimization model for line planning and timetabling in automated urban metro subway networks (Q6315953) (← links)