Using column generation to compute lower bound sets for bi-objective combinatorial optimization problems

Author： Sarpong Boadu Mensah   Artigues Christian   Jozefowiez Nicolas  

Publisher： Edp Sciences

E-ISSN： 1290-3868|49|3|527-554

ISSN： 0399-0559

Source： RAIRO - Operations Research, Vol.49, Iss.3, 2015-02, pp. : 527-554

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

Bi-objective optimization of single-machine batch scheduling under time-of-use electricity prices

By Cheng Junheng   Chu Feng   Chu Chengbin   Xia Weili  

RAIRO - Operations Research, Vol. 50, Iss. 4-5, 2016-11 ,pp. : 715-732

Edp Sciences

Access to resources Recommend Favorite

Bi-objective robust optimization of machined surface quality and productivity under vibrations limitation

By Sahali M.A.  

MATEC Web of conference, Vol. 20, Iss. issue, 2015-01 ,pp. : 03003-03003

Edp Sciences

Access to resources Recommend Favorite

Minmax regret combinatorial optimization problems: an AlgorithmicPerspective

By Candia-Véjar Alfredo   Álvarez-Miranda Eduardo   Maculan Nelson  

RAIRO - Operations Research, Vol. 45, Iss. 2, 2011-08 ,pp. : 101-129

Edp Sciences

Access to resources Recommend Favorite

Solving the bi-objective Robust Vehicle Routing Problem with uncertain costs and demands∗

By Solano-Charris Elyn L.   Prins Christian   Santos Andréa Cynthia  

RAIRO - Operations Research, Vol. 50, Iss. 4-5, 2016-11 ,pp. : 689-714

Edp Sciences

Access to resources Recommend Favorite

Reconfigurable Dynamic Cellular Manufacturing System: A New Bi-Objective Mathematical Model

By Rabbani Masoud   Samavati Mehran   Ziaee Mohammad Sadegh   Rafiei Hamed  

RAIRO - Operations Research, Vol. 48, Iss. 1, 2014-01 ,pp. : 75-102

Edp Sciences

Access to resources Recommend Favorite