Live briefing
Everything about Circulation problem
Generalization of network flow problems
The circulation problem and its variants are a generalisation of network flow problems, with the added constraint of a lower bound on edge flows, and with flow conservation also being required for the source and sink. In variants of the problem, there are multiple commodities flowing through the network, and a cost on the flow. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Circulation problemA 5-minute orientation
- Skim a recent paper: New Exact Algorithm for the integrated train timetabling and rolling stock circulation planning problem with stochastic demandInfluential work since 2022
- Pick up a classic book: AlizéThe most-reprinted book on the subject
- Read the landmark paper: Cancer's Circulation ProblemCited 135 times
- Go sideways: Multi-commodity flow problemA closely related topic
- Go sideways: Flow networkA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Cancer's Circulation Problem
Circulation of the Caribbean Sea: A well‐resolved inverse problem
Combinatorial Algorithms for the Generalized Circulation Problem
Determining the general circulation of the ocean: A nonlinear inverse problem
Eigenanalysis of the two-dimensional wind-driven ocean circulation problem
Fuzzy expert system for solving lost circulation problem
Polynomial-Time Highest-Gain Augmenting Path Algorithms for the Generalized Circulation Problem
A Faster Combinatorial Algorithm for the Generalized Circulation Problem
🆕 Influential since 2022
New Exact Algorithm for the integrated train timetabling and rolling stock circulation planning problem with stochastic demand
Integrated optimization of train timetabling and rolling stock circulation problem with flexible short-turning and energy-saving strategies
The Problem of Logical Self-Circulation in Modern Scientific Theories and Its Resolution
Variational Method for Solving the Quasi-Geostrophic Circulation Problem in a Two-Layer Ocean
Fuzzy Programming Approach for the Electric Multiple Unit Circulation Planning Problem Using Simulated Annealing
📚 Books worth reading
AlizéFrance Robitaille, Marjorie Perreault · 2003
The ocean circulation inverse problemCarl Wunsch · 1996
An Introduction to Ocean TurbulenceS. A. Thorpe · 2007
Ocean circulationAngela Colling · 2001- 📕O postanovke granichnykh usloviĭ dl͡ia rascheta ͡tsirkul͡ia͡tsii atmosfery s regionalʹnym razresheniemV. V. Rykov · 1991
- 📕The search for most unstable scales of disturbances in three-layer atmospheric models with shear and static stabilityW. R Moninger · 1974
- 📕The search for most unstable scales of disturbances in three-layer atmospheric models with shear and static stabilityW. R. Moninger · 1974
The effect of spatial discretization on the steady-state and transient solutions of a dispersive wave equationArthur L. Schoenstadt · 1976
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Multi-commodity flow problem The multi-commodity flow problem is a network flow problem with multiple commodities (flow demands) between different source and sink nodes. Given a flow…
- Flow network In graph theory, a flow network or a transportation network is a directed graph where each edge has a capacity and each edge receives a flow. The amount…
- Minimum-cost flow problem The minimum-cost flow problem (MCFP) is an optimization and decision problem to find the cheapest possible way of sending a certain amount of flow through…
- Maximum flow problem In optimization theory, maximum flow problems involve finding a feasible flow through a flow network that obtains the maximum possible flow rate. The maximum…
- Combinatorial optimization Combinatorial optimization is a subfield of mathematical optimization that consists of finding an optimal object from a finite set of objects, where the…
- Graph partition In mathematics, a graph partition is the reduction of a graph to a smaller graph by partitioning its set of nodes into mutually exclusive groups. Edges…
- Karger's algorithm In computer science and graph theory, Karger's algorithm is a randomized algorithm to compute a minimum cut of a connected graph. It was invented by David…
- PLS (complexity) In computational complexity theory, Polynomial Local Search (PLS) is a complexity class that models the difficulty of finding a locally optimal solution…