The following pages link to Alfredo Daniel Garcia (Q828013):
Displayed 50 items.
- Item:Q828013 (redirect page) (← links)
- Dynamic price competition with switching costs (Q257025) (← links)
- Configurations of non-crossing rays and related problems (Q282735) (← links)
- An efficient algorithm for on-line searching of minima in Monge path-decomposable tridimensional arrays (Q293394) (← links)
- Item:Q828013 (redirect page) (← links)
- ``Cap and trade'' for congestion control (Q369468) (← links)
- Interactive diffusions for global optimization (Q481772) (← links)
- Dynamic platform competition with malicious users (Q483901) (← links)
- Blocking the \(k\)-holes of point sets in the plane (Q497316) (← links)
- Market structure and the competitive effects of switching costs (Q498785) (← links)
- Interactive model-based search with reactive resource allocation (Q506450) (← links)
- Investment dynamics in electricity markets (Q623443) (← links)
- Item:Q828013 (redirect page) (← links)
- Augmenting the rigidity of a graph in \(\mathbb R^{2}\) (Q627536) (← links)
- Financial liquidity: an emergent phenomena (Q828015) (← links)
- On triconnected and cubic plane graphs on given point sets (Q833718) (← links)
- Augmenting the connectivity of outerplanar graphs (Q848960) (← links)
- Compatible geometric matchings (Q924079) (← links)
- Augmenting the connectivity of geometric graphs (Q929747) (← links)
- The two-convex-polygons TSP: A solvable case (Q1367695) (← links)
- Solving nonstationary infinite horizon stochastic production planning problems (Q1593714) (← links)
- Lower bounds on the number of crossing-free subgraphs of \(K_N\) (Q1594599) (← links)
- Markov perfect equilibrium existence for a class of undiscounted infinite-horizon dynamic games (Q1594882) (← links)
- On Hamiltonian alternating cycles and paths (Q1699287) (← links)
- Colored ray configurations (Q1699300) (← links)
- Polynomially solvable cases of the bipartite traveling salesman problem (Q1752819) (← links)
- The order of points on the second convex hull of a simple polygon (Q1895970) (← links)
- Solving nonstationary infinite horizon dynamic optimization problems (Q1977807) (← links)
- Interactive model-based search for global optimization (Q2018506) (← links)
- Metric dimension of maximal outerplanar graphs (Q2045286) (← links)
- Distributed networked learning with correlated data (Q2071980) (← links)
- Packing plane spanning trees into a point set (Q2206739) (← links)
- Total domination in plane triangulations (Q2219969) (← links)
- Geometric biplane graphs. I: Maximal graphs (Q2345511) (← links)
- Geometric biplane graphs. II: Graph augmentation (Q2345512) (← links)
- Computing a Hamiltonian path of minimum Euclidean length inside a simple polygon (Q2392920) (← links)
- Compatible spanning trees (Q2444309) (← links)
- On local transformations in plane geometric graphs embedded on small grids (Q2462732) (← links)
- Plane augmentation of plane graphs to meet parity constraints (Q2656724) (← links)
- (Q2713599) (← links)
- Noise Reduction by Swarming in Social Foraging (Q2979346) (← links)
- Efficient Rate Allocation in Wireless Networks Under Incomplete Information (Q2980584) (← links)
- Dynamic Incentives for Congestion Control (Q2982835) (← links)
- Equilibrium Capacity Expansion Under Stochastic Demand Growth (Q3100448) (← links)
- Packing trees into planar graphs (Q3150194) (← links)
- Auction Design for the Efficient Allocation of Service Capacity Under Congestion (Q3195236) (← links)
- A Decentralized Approach to Discrete Optimization via Simulation: Application to Network Flow (Q3392108) (← links)
- A Game-Theoretic Approach to Efficient Power Management in Sensor Networks (Q3392191) (← links)
- On embedding triconnected cubic graphs on point sets (Q3503515) (← links)
- (Q4405923) (← links)