相关参考文献
注意：仅列出部分参考文献，下载原文获取全部文献信息。Multi-objective optimization of production scheduling with evolutionary computation: A review
Robert Ojstersek et al.
INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING COMPUTATIONS (2020)
An OR practitioner's solution approach to the multidimensional knapsack problem
Zachary Kern et al.
INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING COMPUTATIONS (2020)
A robust approach for solving a vehicle routing problem with time windows with uncertain service and travel times
Mehdi Nasri et al.
INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING COMPUTATIONS (2020)
Rao algorithms: Three metaphor-less simple algorithms for solving optimization problems
Ravipudi Venkata Rao
INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING COMPUTATIONS (2020)
Machine Learning Approaches to Learning Heuristics for Combinatorial Optimization Problems
Sadegh Mirshekarian et al.
28TH INTERNATIONAL CONFERENCE ON FLEXIBLE AUTOMATION AND INTELLIGENT MANUFACTURING (FAIM2018): GLOBAL INTEGRATION OF INTELLIGENT MANUFACTURING AND SMART INDUSTRY FOR GOOD OF HUMANITY (2018)
Complexity Results and Exact Algorithms for Robust Knapsack Problems
Fabrice Talla Nobibon et al.
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS (2014)
Reoptimization in Lagrangian methods for the 0-1 quadratic knapsack problem
Lucas Letocart et al.
COMPUTERS & OPERATIONS RESEARCH (2012)
Heuristic and exact algorithms for the max-min optimization of the multi-scenario knapsack problem
Fumiaki Taniguchi et al.
COMPUTERS & OPERATIONS RESEARCH (2008)
Approximation of min-max and min-max regret versions of some combinatorial optimization problems
Hassene Aissi et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2007)
The quadratic knapsack problem - a survey
David Pisinger
DISCRETE APPLIED MATHEMATICS (2007)
Solution of large quadratic knapsack problems through aggressive reduction
W. David Pisinger et al.
INFORMS JOURNAL ON COMPUTING (2007)
Robust solutions of Linear Programming problems contaminated with uncertain data
A Ben-Tal et al.
MATHEMATICAL PROGRAMMING (2000)
分享论文
