A modified algorithm for the strict feasibility problem

E-ISSN： 1290-3868|35|4|395-399

ISSN： 0399-0559

Source： RAIRO - Operations Research, Vol.35, Iss.4, 2010-03, pp. : 395-399

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 modified algorithm for ANC secondary path modeling

By Zhang Ming Lan Hui Ser Wee

INTER-NOISE and NOISE-CON Congress and Conference Proceedings, Vol. 1999, Iss. 3, 1999-12 ,pp. : 575-578

Institute of Noise Control Engineering

Access to resources Recommend Favorite

An Improved Algorithm for a Bicriteria Batching Scheduling Problem∗

By He Cheng Wang Xiumei Lin Yixun Mu Yundong

RAIRO - Operations Research, Vol. 47, Iss. 1, 2013-02 ,pp. : 1-8

Edp Sciences

Access to resources Recommend Favorite

Solving the simple plant location problem by genetic algorithm

By Kratica Jozef Tošic Dušan Filipović Vladimir Ljubić Ivana

RAIRO - Operations Research, Vol. 35, Iss. 1, 2010-03 ,pp. : 127-142

Edp Sciences

Access to resources Recommend Favorite

A memetic algorithm for the vehicle routing problem with time windows

By Labadi Nacima Prins Christian Reghioui Mohamed

RAIRO - Operations Research, Vol. 42, Iss. 3, 2008-08 ,pp. : 415-431

Edp Sciences

Access to resources Recommend Favorite

A branch-and-price algorithm for the windy rural postman problem

By Afsar Hasan Murat Jozefowiez Nicolas Lopez Pierre

RAIRO - Operations Research, Vol. 45, Iss. 4, 2012-03 ,pp. : 353-364

Edp Sciences

Access to resources Recommend Favorite