相关参考文献
注意：仅列出部分参考文献，下载原文获取全部文献信息。Graphical exploration of the weight space in three-objective mixed integer linear programs
Maria Joao Alves et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2016)
Dynamic programming for spanning tree problems: application to the multi-objective case
Luigi Di Puglia Pugliese et al.
OPTIMIZATION LETTERS (2015)
Output-Sensitive Algorithms for Enumerating the Extreme Nondominated Points of Multiobjective Combinatorial Optimization Problems
Fritz Boekler et al.
ALGORITHMS - ESA 2015 (2015)
Algorithmic improvements on dynamic programming for the bi-objective {0,1} knapsack problem
Jose Rui Figueira et al.
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS (2013)
Connectedness of Efficient Solutions in Multiple Objective Combinatorial Optimization
Jochen Gorski et al.
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS (2011)
An Exact Algorithm for Finding Extreme Supported Nondominated Points of Multiobjective Mixed Integer Programs
Ozgur Ozpeynirci et al.
MANAGEMENT SCIENCE (2010)
A Recursive Algorithm for Finding All Nondominated Extreme Points in the Outcome Set of a Multiobjective Integer Programme
Anthony Przybylski et al.
INFORMS JOURNAL ON COMPUTING (2010)
Computing all efficient solutions of the biobjective minimum spanning tree problem
Sarah Steiner et al.
COMPUTERS & OPERATIONS RESEARCH (2008)
A multiobjective branch-and-bound framework: Application to the biobjective spanning tree problem
Francis Sourd et al.
INFORMS JOURNAL ON COMPUTING (2008)
A minimum spanning tree algorithm with Inverse Ackermann type complexity
B Chazelle
JOURNAL OF THE ACM (2000)
分享论文
