Large language model (LLM)-based systems are becoming increasingly popular for solving tasks by constructing executable workflows that interleave LLM calls, information retrieval, tool use, code execution, memory updates, and verification. This survey reviews recent methods for designing and optimizing such workflows, which we treat as agentic computation graphs (ACGs). We classify the literature according to when workflow structure is determined. This lens distinguishes static methods, which fix a reusable workflow scaffold before deployment, from dynamic methods, which select, generate, or revise the workflow for a particular run before or during execution. We further categorize existing work along three dimensions: when structure is determined, which aspect of the workflow is optimized, and which evaluation signals govern optimization (e.g., task metrics, verifier signals, human preferences, or trace-derived feedback). We also distinguish reusable workflow templates, run-specific realized graphs, and execution traces, separating design-time choices from runtime behavior. Finally, we outline a structure-aware evaluation perspective that complements downstream task metrics with graph-level properties, execution cost, robustness, and structural variation across inputs. This work aims to establish a principled vocabulary, a unified framework for situating new methods, a systematic comparison of existing work, and a minimum reporting protocol for LLM agent workflow optimization.