A class of constrained semi\|infinite minimax problem is transformed into a simple constrained problem, by means of discretization decomposition and maximum entropy method, making use of surrogate constraint. The pa...A class of constrained semi\|infinite minimax problem is transformed into a simple constrained problem, by means of discretization decomposition and maximum entropy method, making use of surrogate constraint. The paper deals with the convergence of this asymptotic approach method.展开更多
In this paper, a branch-and-bound method for solving multi-dimensional quadratic 0-1 knapsack problems was studied. The method was based on the Lagrangian relaxation and the surrogate constraint technique for finding ...In this paper, a branch-and-bound method for solving multi-dimensional quadratic 0-1 knapsack problems was studied. The method was based on the Lagrangian relaxation and the surrogate constraint technique for finding feasible solutions. The Lagrangian relaxations were solved with the maximum-flow algorithm and the Lagrangian bounds was determined with the outer approximation method. Computational results show the efficiency of the proposed method for multi-dimensional quadratic 0-1 knapsack problems.展开更多
文摘A class of constrained semi\|infinite minimax problem is transformed into a simple constrained problem, by means of discretization decomposition and maximum entropy method, making use of surrogate constraint. The paper deals with the convergence of this asymptotic approach method.
基金Project supported by the National Natural Science Foundation of China （Grant No.10571116）
文摘In this paper, a branch-and-bound method for solving multi-dimensional quadratic 0-1 knapsack problems was studied. The method was based on the Lagrangian relaxation and the surrogate constraint technique for finding feasible solutions. The Lagrangian relaxations were solved with the maximum-flow algorithm and the Lagrangian bounds was determined with the outer approximation method. Computational results show the efficiency of the proposed method for multi-dimensional quadratic 0-1 knapsack problems.
