mixed-integer programming;
cutting planes;
B& B penalties;
D O I:
10.1016/S0167-6377(03)00014-2
中图分类号:
C93 [管理学];
O22 [运筹学];
学科分类号:
070105 ;
12 ;
1201 ;
1202 ;
120202 ;
摘要:
We propose a new class of foundation-penalty (FP) cuts for MIPs that are easy to generate by exploiting routine penalty calculations. Their underlying concept generalizes the lifting process and provides derivations of major classical cuts. (Gomory cuts arise from low level FP cuts by simply 'plugging in' standard penalties.) (C) 2003 Elsevier Science B.V. All rights reserved.
机构:
Department of Computer Science and Software Engineering, Concordia University, MontrealDepartment of Computer Science and Software Engineering, Concordia University, Montreal
Chvátal V.
Cook W.
论文数: 0引用数: 0
h-index: 0
机构:
Department of Industrial Engineering, University of Pittsburgh, PittsburghDepartment of Computer Science and Software Engineering, Concordia University, Montreal
Cook W.
Espinoza D.
论文数: 0引用数: 0
h-index: 0
机构:
Department of Industrial Engineering, Universidad de Chile, SantiagoDepartment of Computer Science and Software Engineering, Concordia University, Montreal