On the Maximum Noninteger Polyhedron Vertices of the Three-index Axial Assignment Problem

ISSN： 0005-1179

Source： Automation and Remote Control, Vol.65, Iss.3, 2004-03, pp. : 413-421

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

On the Noninteger Polyhedron Vertices of the Three-index Axial Transportation Problem

By Kravtsov M. K. Lukshin E. V.

Automation and Remote Control, Vol. 65, Iss. 3, 2004-03 ,pp. : 422-430

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

The small hexagon and heptagon with maximum sum of distances between vertices

By Audet Charles Guillou Anthony Hansen Pierre Messine Frédéric Perron Sylvain

Journal of Global Optimization, Vol. 49, Iss. 3, 2011-03 ,pp. : 467-480

Springer Publishing Company

Access to resources Recommend Favorite

The Maximum Utilization Subtree Problem

By George J.W.

Annals of Operations Research, Vol. 110, Iss. 1-4, 2002-02 ,pp. : 133-151

Springer Publishing Company

Access to resources Recommend Favorite

The Stochastic Location-Assignment Problem on a Tree

By Zeng Ting Ward James

Annals of Operations Research, Vol. 136, Iss. 1, 2005-04 ,pp. : 81-97

Springer Publishing Company

Access to resources Recommend Favorite

DGAP - The Dynamic Generalized Assignment Problem

By Kogan K. Shtub A.

Annals of Operations Research, Vol. 69, Iss. 1, 1997-01 ,pp. : 227-239

Springer Publishing Company

Access to resources Recommend Favorite