Relaxations and heuristics for the multiple non-linear separable knapsack problem-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Relaxations and heuristics for the multiple non-linear separable knapsack problem

Published:2018-05 Issue: Volume:93 Page:79-89
ISSN:0305-0548
Container-title:Computers & Operations Research
language:en
Short-container-title:Computers & Operations Research

Author:

D’Ambrosio Claudia,Martello Silvano^ORCID,Mencarelli Luca

Funder

MIUR-Italy

Air Force Office of Scientific Research

Marie Curie 7th European Framework Programme

Publisher

Elsevier BV

Subject

Management Science and Operations Research,Modelling and Simulation,General Computer Science

Reference16 articles.

1. Branching and bounds tightening techniques for non–convex MINLP;Belotti;Optim. Methods Softw.,2009

2. Bonmin https://projects.coin-or.org/Bonmin.

3. The nonlinear knapsack problem – algorithms and applications;Bretthauer;Eur. J. Oper. Res.,2002

4. Couenne https://projects.coin-or.org/Couenne.

5. A Heuristic Algorithm for the General Multiple Nonlinear Knapsack Problem;D’Ambrosio,2015

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

1. An optimization method to solve a fully intuitionistic fuzzy non-linear separable programming problem;RAIRO - Operations Research;2023-11

2. Integer knapsack problems with profit functions of the same value range;4OR-Q J OPER RES;2023

3. Approximating single- and multi-objective nonlinear sum and product knapsack problems;Discrete Optimization;2023-05

4. Knapsack problems — An overview of recent advances. Part II: Multiple, multidimensional, and quadratic knapsack problems;Computers & Operations Research;2022-07

5. A threshold search based memetic algorithm for the disjunctively constrained knapsack problem;Computers & Operations Research;2021-12

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号京ICP备18003416号-3