A problem in enumerating extreme points, and an efficient algorithm for one class of polytopes

ISSN： 1862-4472

Source： Optimization Letters, Vol.3, Iss.2, 2009-03, pp. : 211-237

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

Viviani Polytopes and Fermat Points

By Zhou Li

The College Mathematics Journal, Vol. 43, Iss. 4, 2012-09 ,pp. : 309-312

Mathematical Association of America

Access to resources Recommend Favorite

An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF

By Davydov G.

Annals of Mathematics and Artificial Intelligence, Vol. 23, Iss. 3-4, 1998-01 ,pp. : 229-245

Springer Publishing Company

Access to resources Recommend Favorite

An efficient approximation algorithm for the survivable network design problem

By Gabow H.N. Goemans M.X. Williamson D.P.

Mathematical Programming, Vol. 82, Iss. 1, 1998-06 ,pp. : 13-40

Elsevier

Access to resources Recommend Favorite

Complete description of a class of knapsack polytopes

By Dahl G. Foldnes N.

Operations Research Letters, Vol. 31, Iss. 5, 2003-09 ,pp. : 335-340

Elsevier

Access to resources Recommend Favorite

A Lost Counterexample and a Problem on Illuminated Polytopes

By Wotzlaw Ronald F. Ziegler Günter M.

American Mathematical Monthly, Vol. 118, Iss. 6, 2011-06 ,pp. : 534-543

Mathematical Association of America

Access to resources Recommend Favorite