The convex linear combination method and the lattice duality prinicple in transport problems

zbMath1057.90529MaRDI QIDQ1881976

A. A. Mironov, Vladimir I. Tsurkov

Publication date: 18 October 2004

Published in: Automation and Remote Control (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)

This page was built for publication: The convex linear combination method and the lattice duality prinicple in transport problems