Non Delayed Relax-and-Cut Algorithms

ISSN： 0254-5330

Source： Annals of Operations Research, Vol.140, Iss.1, 2005-11, pp. : 375-410

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

Uncapacitated Euclidean Hub Location: Strengthened Formulation, New Facets and a Relax-and-cut Algorithm

By Marín Alfredo

Journal of Global Optimization, Vol. 33, Iss. 3, 2005-11 ,pp. : 393-422

Springer Publishing Company

Access to resources Recommend Favorite

Parallel algorithms for the minimum cut and the minimum length tree layout problems

By Diaz J. Gibbons A. Pantziou G.E. Serna M.J. Spirakis P.G. Toran J.

Theoretical Computer Science, Vol. 181, Iss. 2, 1997-07 ,pp. : 267-287

Elsevier

Access to resources Recommend Favorite

Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Decompositions

By Dorn Frederic Penninkx Eelko Bodlaender Hans Fomin Fedor

Algorithmica, Vol. 58, Iss. 3, 2010-11 ,pp. : 790-810

Springer Publishing Company

Access to resources Recommend Favorite

Algorithms for the non-bifurcated network design problem

By Bartolini Enrico Mingozzi Aristide

Journal of Heuristics, Vol. 15, Iss. 3, 2009-06 ,pp. : 259-281

Springer Publishing Company

Access to resources Recommend Favorite

Non‐clairvoyant reduction algorithms for heterogeneous platforms

CONCURRENCY AND COMPUTATION: PRACTICE & EXPERIENCE (ELECTRONIC), Vol. 27, Iss. 6, 2015-04 ,pp. : 1612-1624

John Wiley & Sons Inc

Access to resources Recommend Favorite