Valid inequalities and separation for mixed 0–1 constraints with variable upper bounds

1989 ◽  
Vol 8 (6) ◽  
pp. 315-322 ◽  
Author(s):  
Michel X. Goemans
2001 ◽  
Vol 91 (1) ◽  
pp. 145-162 ◽  
Author(s):  
Alper Atamtürk ◽  
George L. Nemhauser ◽  
Martin W.P. Savelsbergh

2015 ◽  
Vol 2015 ◽  
pp. 1-8 ◽  
Author(s):  
Yonggang Chang ◽  
Huizhi Ren ◽  
Shijie Wang

This paper addresses a special truck scheduling problem in the open-pit mine with different transport revenue consideration. A mixed integer programming model is formulated to define the problem clearly and a few valid inequalities are deduced to strengthen the model. Some properties and two upper bounds of the problem are proposed. Based on these inequalities, properties, and upper bounds, a heuristic solution approach with two improvement strategies is proposed to resolve the problem and the numerical experiment demonstrates that the proposed solution approach is effective and efficient.


Sign in / Sign up

Export Citation Format

Share Document