Algorithm robust for the bicriteria discrete optimization problem: Heuristic variations and computational evidence

ISSN： 0254-5330

Source： Annals of Operations Research, Vol.147, Iss.1, 2006-10, pp. : 71-85

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

Ant colony optimization algorithm for a Bi-criteria 2-stage hybrid flowshop scheduling problem

By Solano-Charris Elyn

Journal of Intelligent Manufacturing, Vol. 22, Iss. 5, 2011-10 ,pp. : 815-822

Springer Publishing Company

Access to resources Recommend Favorite

Meta-Heuristic Algorithms to Solve Bi-Criteria Parallel Machines Scheduling Problem

International Journal of Applied Evolutionary Computation (IJAEC), Vol. 7, Iss. 2, 2016-04 ,pp. : 76-96

IGI Global_journal

Access to resources Recommend Favorite

An Application of a Multi-Objective Tabu Search Algorithm to a Bicriteria Flowshop Problem

By Armentano Vinícius Amaral Claudio José Elias

Journal of Heuristics, Vol. 10, Iss. 5, 2004-09 ,pp. : 463-481

Springer Publishing Company

Access to resources Recommend Favorite

Heuristic Procedures for Solving the Discrete Ordered Median Problem

By Domínguez-Marín Patricia Nickel Stefan Hansen Pierre Mladenović Nenad

Annals of Operations Research, Vol. 136, Iss. 1, 2005-04 ,pp. : 145-173

Springer Publishing Company

Access to resources Recommend Favorite

A discrete shuffled frog optimization algorithm

By Vakil Baghmisheh M.

Artificial Intelligence Review, Vol. 36, Iss. 4, 2011-12 ,pp. : 267-284

Springer Publishing Company

Access to resources Recommend Favorite