Abstract
A new heuristic algorithm is presented for solving large general fixed charge problems based on Langrangian relaxation and cost allocation heuristics. Limited computational results indicate the new algorithm provides good solutions to large problems with reasonable computational requirements. It demonstrates significant improvement over current methods for solving large general fixed charge problems.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
