Copertina

The Minimum‐Cost Dynamic Flow Problem in a Fixed Graph With a Constant Target Flow Value

Fuente: Wiley Open Access

Salvato in:

Dettagli Bibliografici
Autore principale:	Naoyuki Kamiyama
Natura:	Artículo Open Access
Pubblicazione:	Wiley 2025
Soggetti:	Networks
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

The Strongly Stable Matching Problem with Closures
di: Kamiyama, Naoyuki
Pubblicazione: (2024)

The Strongly Stable Roommates Problem and Linear Programming
di: Kamiyama, Naoyuki
Pubblicazione: (2025)

Modifying an Instance of the Super-Stable Matching Problem
di: Kamiyama, Naoyuki
Pubblicazione: (2024)

A Linear Programming Approach to the Super-Stable Roommates Problem
di: Kamiyama, Naoyuki
Pubblicazione: (2025)

The Set of Stable Matchings and the Core in a Matching Market with Ties and Matroid Constraints
di: Kamiyama, Naoyuki
Pubblicazione: (2024)

Minimum Sum Coloring with Bundles in Trees and Bipartite Graphs
di: Ito, Takehiro, et al.
Pubblicazione: (2025)

Non-uniformly Stable Common Independent Sets
di: Kamiyama, Naoyuki
Pubblicazione: (2026)

Non-uniformly Stable Matchings
di: Kamiyama, Naoyuki
Pubblicazione: (2024)

Finding Nontrivial Minimum Fixed Points in Discrete Dynamical Systems
di: Qiu, Zirou, et al.
Pubblicazione: (2023)

On the Characterization of an Extreme Flow in a Two Commodity Network Flow Problem
di: Yung-Ching, Chu, et al.
Pubblicazione: (1975)

Loss Minimization for Electrical Flows over Spanning Trees on Grids
di: Ito, Takehiro, et al.
Pubblicazione: (2024)

A Necessary Condition for Connectedness of Solutions to Integer Linear Systems
di: Shigenobu, Takasugu, et al.
Pubblicazione: (2025)

On Connectedness of Solutions to Integer Linear Systems
di: Shigenobu, Takasugu, et al.
Pubblicazione: (2024)

Minimum Congestion Routing of Unsplittable Flows in Data-Center Networks
di: Ferreira, Miguel, et al.
Pubblicazione: (2025)

The Minimum Clique Routing Problem on Cycles
di: M. Escalante, et al.
Pubblicazione: (2025)

On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction Problems
di: DeHaan, Ian, et al.
Pubblicazione: (2025)

Minimum-Cost Sensor Channel Selection For Wearable Computing
di: Sah, Ramesh Kumar, et al.
Pubblicazione: (2024)

SENSOR: A Cost-Efficient Open-Source Flow Monitoring Platform
di: Paradzik, Gabriel, et al.
Pubblicazione: (2025)

Minimum-Peak-Cost Flows Over Time
di: Anapolska, Mariia, et al.
Pubblicazione: (2025)

Minimum-Cost Network Flow with Dual Predictions
di: Chen, Zhiyang, et al.
Pubblicazione: (2026)

Approximation Algorithm for the Minimum Interval Partial Multi‐Cover Problem
di: Yingli Ran, et al.
Pubblicazione: (2024)

Coordinated Sampling in SDNs with Dynamic Flow Rates
di: Esmaeilian, Soroosh, et al.
Pubblicazione: (2024)

Graph Neural Modeling of Network Flows
di: Darvariu, Victor-Alexandru, et al.
Pubblicazione: (2022)

Compact Mixed Integer Programming Formulations for the Minimum Biclique Cover Problem
di: Bruno Burin, et al.
Pubblicazione: (2025)

On a Variant of the Minimum Path Cover Problem in Acyclic Digraphs: Computational Complexity Results and Exact Method
di: Nour ElHouda Tellache, et al.
Pubblicazione: (2025)

Forecasting Individual NetFlows using a Predictive Masked Graph Autoencoder
di: Anyfantis, Georgios, et al.
Pubblicazione: (2026)

Tractable but Hard to Approximate: The Bi‐Objective Minimum s‐t‐Cut Problem With Binary Capacities
di: Jan Boeckmann, et al.
Pubblicazione: (2026)

Bridging Nodes and Narrative Flows: Identifying Intervention Targets for Disinformation on Telegram
di: Shah, Devang, et al.
Pubblicazione: (2024)

Fast Computation of Kemeny's Constant for Directed Graphs
di: Xia, Haisong, et al.
Pubblicazione: (2024)

Component parts of the World Heat Flow Data Collection
di: Fujii, Naoyuki
Pubblicazione: (1981)

Analysis of a transport network based on georeference system and Multicommodity Network Flow
di: C. A. Nava Fonseca
Pubblicazione: (2006)

Minimum Cost Nowhere-zero Flows and Cut-balanced Orientations
di: Chandrasekaran, Karthekeyan, et al.
Pubblicazione: (2025)

Flow Divergence: Comparing Maps of Flows with Relative Entropy
di: Blöcker, Christopher, et al.
Pubblicazione: (2024)

Synthesizing Diverse Network Flow Datasets with Scalable Dynamic Multigraph Generation
di: Grayeli, Arya, et al.
Pubblicazione: (2025)

A Subquadratic Two-Party Communication Protocol for Minimum Cost Flow
di: Gholizadeh, Hossein, et al.
Pubblicazione: (2025)

A Formal Analysis of Capacity Scaling Algorithms for Minimum-Cost Flows
di: Abdulaziz, Mohammad, et al.
Pubblicazione: (2026)

An Affine Linear Solution of the Nonlinear Inverse Power Flow Problem in Resistive Networks
di: Martin Wachs, et al.
Pubblicazione: (2025)

Optimizing Connected Components Graph Partitioning With Minimum Size Constraints Using Integer Programming and Spectral Clustering Techniques
di: Mishelle Cordero, et al.
Pubblicazione: (2024)

FlowEqProp: Training Flow Matching Generative Models with Gradient Equilibrium Propagation
di: Gower, Alex
Pubblicazione: (2026)

FlowsDT: A Geospatial Digital Twin for Navigating Urban Flood Dynamics
di: Mandal, Debayan, et al.
Pubblicazione: (2025)