Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems

Published 2015 View Full Article

  1. Home
  2. Publications
  3. Publication Search
  4. Publication Details
Title
Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems
Authors
Keywords
Combinatorial optimization, Multiple objective programming, Bi-dimensional binary knapsack problem, Surrogate relaxation, Bound sets
Journal
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volume 244, Issue 2, Pages 417-433
Publisher
Elsevier BV
Online
2015-01-28
DOI
10.1016/j.ejor.2015.01.035

Ask authors/readers for more resources

Protocol

Community support

Reagent

Community support

Reprint

Contact the author

Find the ideal target journal for your manuscript

Explore over 38,000 international journals covering a vast array of academic fields.

Search

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
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.