The nucleolus and kernel for simple games or special valid inequalities for 0–1 linear integer programs

1976 ◽  
Vol 5 (4) ◽  
pp. 227-238 ◽  
Author(s):  
L. A. Wolsey
Author(s):  
Michele Conforti ◽  
Gérard Cornuéjols ◽  
Giacomo Zambelli

2022 ◽  
Author(s):  
Jens Vinther Clausen ◽  
Richard Lusby ◽  
Stefan Ropke

A New Family of Valid-Inequalities for Dantzig-Wolfe Reformulation of Mixed Integer Linear Programs In “Consistency Cuts for Dantzig-Wolfe Reformulation,” Jens Vinther Clausen, Richard Lusby, and Stefan Ropke present a new family of valid inequalities to be applied to Dantzig-Wolfe reformulations with binary linking variables. They show that, for Dantzig-Wolfe reformulations of mixed integer linear programs that satisfy certain properties, it is enough to solve the linear programming relaxation of the Dantzig-Wolfe reformulation with all consistency cuts to obtain integer solutions. An example of this is the temporal knapsack problem; the effectiveness of the cuts is tested on a set of 200 instances of this problem, and the results are state-of-the-art solution times. For problems that do not satisfy these conditions, the cuts can still be used in a branch-and-cut-and-price framework. In order to show this, the cuts are applied to a set of generic mixed linear integer programs from the online library MIPLIB. These tests show the applicability of the cuts in general.


1982 ◽  
Vol 1 (2) ◽  
pp. 63-66 ◽  
Author(s):  
Achim Bachem ◽  
Ellis L. Johnson ◽  
Rainer Schrader

Sign in / Sign up

Export Citation Format

Share Document