A heuristic algorithm for a network problem with variable upper bounds

Networks ◽  
1990 ◽  
Vol 20 (4) ◽  
pp. 373-389 ◽  
Author(s):  
Bala Shetty
Keyword(s):  
Heuristic Algorithm ◽  
Upper Bounds ◽  
Network Problem ◽  
Variable Upper Bounds

scholarly journals An ADD/DROP procedure for the capacitated plant location problem

2004 ◽  
Vol 24 (1) ◽  
pp. 151-162 ◽  
Author(s):  
Claudio Thomas Bornstein ◽  
Manoel Campêlo
Keyword(s):  
Heuristic Algorithm ◽  
Location Problem ◽  
Lagrangean Relaxation ◽  
Upper Bounds ◽  
Transportation Costs ◽  
Plant Location ◽  
Computational Results ◽  
Lower And Upper Bounds

The capacitated plant location problem with linear transportation costs is considered. Exact rules and heuristics are presented for opening or closing of facilities. A heuristic algorithm based on ADD/DROP strategies is proposed. Procedures are implemented with the help of lower and upper bounds using Lagrangean relaxation. Computational results are presented and comparisons with other algorithms are made.

scholarly journals Valid inequalities for problems with additive variable upper bounds

2001 ◽  
Vol 91 (1) ◽  
pp. 145-162 ◽  
Author(s):  
Alper Atamtürk ◽  
George L. Nemhauser ◽  
Martin W.P. Savelsbergh
Keyword(s):  
Valid Inequalities ◽  
Upper Bounds ◽  
Variable Upper Bounds
Sign in / Sign up

Export Citation Format

Share Document