Network optimization and problems with coupling variables
From MaRDI portal
Publication:2263904
DOI10.1134/S1064230714030071zbMath1308.93019MaRDI QIDQ2263904
D. I. Kuzovlev, A. S. Esenkov, A. P. Tizik, V. Yu. Leonov, Vladimir I. Tsurkov
Publication date: 19 March 2015
Published in: Journal of Computer and Systems Sciences International (Search for Journal in Brave)
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Large-scale systems (93A15)
Related Items (2)
Packing circular-like objects in a rectangular container ⋮ Nonlinear integer transportation problem with additional supply and consumption points
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimax in transportation models with integral constraints. I
- The problem of efficient network operation
- Many-dimensional knapsack problem of a special ladder structure
- Open transportation models with a minimax criterion.
- Closed transportation models with minimax criterion
- Network models with fixed parameters at the communication nodes. II
- Network models with fixed parameters at the communication nodes. I
- Iterative functional modification method for solving a transportation problem
- Iterative method for the transportation problem with additional supply and consumption points and quadratic cost
- Minimax in transportation models with integral constraints. II
This page was built for publication: Network optimization and problems with coupling variables