Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems-Reference-Cited by-同舟云学术

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

Published:2015-07 Issue:2 Volume:244 Page:417-433
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Cerqueus Audrey,Przybylski Anthony,Gandibleux Xavier

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modelling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference35 articles.

1. Bicriteria transportation problem;Aneja;Management Science,1979

2. Solving efficiently the 0-1 multi-objective knapsack problem;Bazgan;Computers and Operations Research,2009

3. Contribution à la programmation en nombres entiers;Boyer,2007

4. Heuristics for the 0–1 multidimensional knapsack problem;Boyer;European Journal of Operational Research,2009

5. The off-line group seat reservation problem;Clausen;European Journal of Operational Research,2010

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On the strength of Lagrangian duality in multiobjective integer programming;Mathematical Programming;2024-08-20

2. Parallel implementation of an exact two-phase method for the biobjective knapsack problem;RAIRO - Operations Research;2024-07

3. A surrogate-based heuristic for production planning problem of orders in small foundries;Computers & Operations Research;2024-04

4. A Lagrangian bounding and heuristic principle for bi-objective discrete optimization;Operational Research;2024-03-11

5. Relaxations and duality for multiobjective integer programming;Mathematical Programming;2023-10-12