Extremal values of global tolerances in combinatorial optimization with an additive objective function
AbstractNo abstract is available for this item.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoArticle provided by Springer in its journal Journal of Global Optimization.
Volume (Year): 53 (2012)
Issue (Month): 3 (July)
Contact details of provider:
Web page: http://www.springer.com/business/operations+research/journal/10898
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Turkensteen, Marcel & Ghosh, Diptesh & Goldengorin, Boris & Sierksma, Gerard, 2008. "Tolerance-based Branch and Bound algorithms for the ATSP," European Journal of Operational Research, Elsevier, vol. 189(3), pages 775-788, September.
- Goldengorin, Boris & Sierksma, Gerard, 2003. "Combinatorial optimization tolerances calculated in linear time," Research Report 03A30, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
- Helsgaun, Keld, 2000. "An effective implementation of the Lin-Kernighan traveling salesman heuristic," European Journal of Operational Research, Elsevier, vol. 126(1), pages 106-130, October.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Guenther Eichhorn) or (Christopher F Baum).
If references are entirely missing, you can add them using this form.