Open transportation models with a minimax criterion.

zbMath1090.90539MaRDI QIDQ1432609

A. A. Mironov, Vladimir I. Tsurkov

Publication date: 15 June 2004

Published in: Doklady Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items (13)

Organization of the control subsystem in real-time computing systems ⋮ Optimizing the selection of a biometric template from a sequence ⋮ Packing circular-like objects in a rectangular container ⋮ 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 ⋮ Network optimization and problems with coupling variables ⋮ Hypergraph recovery algorithms from a given vector of vertex degrees ⋮ Method of characteristic functions for classes of networks with fixed node degrees ⋮ Nonlinear integer transportation problem with additional supply and consumption points

This page was built for publication: Open transportation models with a minimax criterion.