A strongly polynomial Algorithm for minimum cost submodular flow problems.
Збережено в:
| Автор: | |
|---|---|
| Інші автори: | , |
| Формат: | Книга |
| Мова: | Англійська |
| Опубліковано: |
Kaiserslautern
1986
|
| Теги: |
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|
| Order eBook: |
|
| Order Book: | Login to order |
Схожі ресурси: A strongly polynomial Algorithm for minimum cost submodular flow problems.
- A strongly polynomial Algorithm for minimum cost submodular flow problems
- A strongly polynomial Algorithm for minimum cost submodular flow problems
- Duality for balanced submodular flows.
- The Cost Principle in minimum price regulation
- Polynomial Time-Algorithms for the Nielsen reduction and related problems in free groups
- Polynomial Algorithms for problems in free groups based on Nielsen type arguments.