A minimax under nonlinear transportation constraints.
From MaRDI portal
Publication:1432601
zbMath1090.90538MaRDI QIDQ1432601
A. A. Mironov, Vladimir I. Tsurkov
Publication date: 15 June 2004
Published in: Doklady Mathematics (Search for Journal in Brave)
Minimax problems in mathematical programming (90C47) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Related Items (12)
Optimizing the selection of a biometric template from a sequence ⋮ Optimal correction of execution intervals for multiprocessor scheduling with additional resource ⋮ Minimizing customers' waiting time in a vehicle routing problem with unit demands ⋮ Methods for improving image quality using spatial spectral analysis ⋮ Step graphs and their application to the organization of commodity flows in networks ⋮ Optimization problems of transportation in communication networks with variable capacities ⋮ Making schedules in multiprocessing systems with several additional resources ⋮ Improved Lagrangian bounds and heuristics for the generalized assignment problem ⋮ Hypergraph recovery algorithms from a given vector of vertex degrees ⋮ Method of characteristic functions for classes of networks with fixed node degrees ⋮ Scheduling in multiprocessor systems with additional restrictions ⋮ Nonlinear integer transportation problem with additional supply and consumption points
This page was built for publication: A minimax under nonlinear transportation constraints.
