A multi-objective tabu search algorithm based on decomposition for multi-objective unconstrained binary quadratic programming problem

Published 2018 View Full Article

  1. Home
  2. Publications
  3. Publication Search
  4. Publication Details
Title
A multi-objective tabu search algorithm based on decomposition for multi-objective unconstrained binary quadratic programming problem
Authors
Keywords
-
Journal
KNOWLEDGE-BASED SYSTEMS
Volume 141, Issue -, Pages 18-30
Publisher
Elsevier BV
Online
2017-11-27
DOI
10.1016/j.knosys.2017.11.009

Ask authors/readers for more resources

Protocol

Community support

Reagent

Community support

Reprint

Contact the author

Become a Peeref-certified reviewer

The Peeref Institute provides free reviewer training that teaches the core competencies of the academic peer review process.

Get Started

Ask a Question. Answer a Question.

Quickly pose questions to the entire community. Debate answers and get clarity on the most important issues facing researchers.

Get Started
Webinars Posters Questions Hubs Funding Journals Articles Connect Collections Reviewers About Us FAQs Mobile App Privacy Policy Terms of Use
© Peeref 2019-2024. All rights reserved.