Primal-dual approximation algorithms for a packing-covering pair of problems

Author： Kovaleva Sofia   Spieksma Frits C.R.  

Publisher： Edp Sciences

E-ISSN： 1290-3868|36|1|53-71

ISSN： 0399-0559

Source： RAIRO - Operations Research, Vol.36, Iss.1, 2010-03, pp. : 53-71

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

A note on dual approximation algorithms for class constrained bin packing problems

By Xavier Eduardo C.   Miyazawa Flàvio Keidi  

RAIRO - Theoretical Informatics and Applications, Vol. 43, Iss. 2, 2008-10 ,pp. : 239-248

Edp Sciences

Access to resources Recommend Favorite

Kernel-function Based Primal-Dual Algorithms for P*(κ) Linear Complementarity Problems

By EL Ghami M.   Steihaug T.  

RAIRO - Operations Research, Vol. 44, Iss. 3, 2010-07 ,pp. : 185-205

Edp Sciences

Access to resources Recommend Favorite

Primal-dual entropy-based interior-point algorithms for linear optimization

By Karimi Mehdi   Luo Shen   Tunçel Levent  

RAIRO - Operations Research, Vol. 51, Iss. 2, 2017-02 ,pp. : 299-328

Edp Sciences

Access to resources Recommend Favorite

Online LIB problems: Heuristics for Bin Covering and lower boundsfor Bin Packing

By Finlay Luke   Manyem Prabhu  

RAIRO - Operations Research, Vol. 39, Iss. 3, 2006-01 ,pp. : 163-183

Edp Sciences

Access to resources Recommend Favorite

Generic Primal-dual Interior Point Methods Based on a New Kernel Function

By EL Ghami M.   Roos C.  

RAIRO - Operations Research, Vol. 42, Iss. 2, 2008-05 ,pp. : 199-213

Edp Sciences

Access to resources Recommend Favorite