Skip to content
Descubridor Institucional UMAR
Inicio
Búsqueda avanzada
Explorar
Inicio
Búsqueda avanzada
Explorar
Login
Language
English
Deutsch
Español
Français
Italiano
All Fields
Title
Author
Subject
Call Number
ISBN/ISSN
Tag
Find
Advanced
The Minimum‐Cost Dynamic Flow Problem in a Fixed Graph With a Constant Target Flow Value
The Minimum‐Cost Dynamic Flow Problem in a Fixed Graph With a Constant Target Flow Value
Fuente:
Wiley Open Access
Saved in:
Bibliographic Details
Main Author:
Naoyuki Kamiyama
Format:
Artículo Open Access
Published:
Wiley
2025
Subjects:
Networks
Online Access:
Acceder al recurso
Tags:
Add Tag
No Tags, Be the first to tag this record!
Cite this
Text this
Email this
Print
Export Record
Export to RefWorks
Export to EndNoteWeb
Export to EndNote
Save to List
Permanent link
Holdings
Description
Comments
Similar Items
Staff View
Internet
https://onlinelibrary.wiley.com/doi/10.1002/net.22272
Similar Items
The Strongly Stable Matching Problem with Closures
by: Kamiyama, Naoyuki
Published: (2024)
The Strongly Stable Roommates Problem and Linear Programming
by: Kamiyama, Naoyuki
Published: (2025)
Modifying an Instance of the Super-Stable Matching Problem
by: Kamiyama, Naoyuki
Published: (2024)
A Linear Programming Approach to the Super-Stable Roommates Problem
by: Kamiyama, Naoyuki
Published: (2025)
The Set of Stable Matchings and the Core in a Matching Market with Ties and Matroid Constraints
by: Kamiyama, Naoyuki
Published: (2024)