Choosing the capacity of arcs with constraint on flow delay time
From MaRDI portal
Publication:2281352
DOI10.1007/s10559-019-00165-0zbMath1435.90124OpenAlexW2966734597MaRDI QIDQ2281352
O. M. Trofymchuk, V. A. Vasyanin
Publication date: 19 December 2019
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10559-019-00165-0
Cites Work
- A multi-criteria approach to approximate solution of multiple-choice knapsack problem
- Algorithms for sequential analysis and fathoming in discrete optimization problems
- Efficient generation of the binary reflected gray code and its applications
- Reducibility among Combinatorial Problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Choosing the capacity of arcs with constraint on flow delay time