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

Audrey Cerqueus; Anthony Przybylski; Xavier Gandibleux

doi:10.1016/j.ejor.2015.01.035

ScienceGate Book Chapters

JOURNAL ARTICLE

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

Audrey Cerqueus Anthony Przybylski Xavier Gandibleux

Year: 2015 Journal: European Journal of Operational Research Vol: 244 (2)Pages: 417-433 Publisher: Elsevier BV

DOI: 10.1016/j.ejor.2015.01.035

Get Full-Text PDF Get Analytical Report

Keywords:

Knapsack problem Upper and lower bounds Mathematics Binary number Algorithm Branch and bound Mathematical optimization Regular polygon Computation Set (abstract data type) Relaxation (psychology) Computer science

Metrics

Cited By

1.30

FWCI (Field Weighted Citation Impact)

Refs

0.84

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Advanced Multi-Objective Optimization Algorithms

Physical Sciences → Computer Science → Computational Theory and Mathematics

Optimization and Packing Problems

Physical Sciences → Engineering → Industrial and Manufacturing Engineering

Advanced Manufacturing and Logistics Optimization

Physical Sciences → Engineering → Industrial and Manufacturing Engineering

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

Metrics

Citation History

Topics

Related Documents

Solving 0-1 Bi-Objective Multi-dimensional Knapsack Problems Using Binary Genetic Algorithm

On Local Search for Bi-objective Knapsack Problems

Compressed data structures for bi-objective {0,1}-knapsack problems

Bi-dimensional knapsack problems with one soft constraint

Solving hard bi-objective knapsack problems using deep reinforcement learning