作者: Jianzhong Zhang , Zhongfan Ma
关键词: Mathematics 、 Cutting stock problem 、 Computational problem 、 Mathematical optimization 、 Combinatorial optimization 、 Generalized assignment problem 、 Steiner tree problem 、 Optimization problem 、 1-center problem 、 Quadratic assignment problem
摘要: In this paper we consider some inverse combinatorial optimization problems, that is, for a given set of feasible solutions an problem, wish to know: under what weight vectors (or capacity vectors) will these become optimal solutions? We analysed shortest path minimum cut spanning tree problem and maximum-weight matching found in each cases, the solution is charaterized by solving another problem. The main tool our approach Fulkerson's theory blocking anti-blocking polyhedra with necessary revisions.