Extremal values of global tolerances in combinatorial optimization with an additive objective function
No abstract is available for this item.
Volume (Year): 53 (2012)
Issue (Month): 3 (July)
|Contact details of provider:|| Web page: http://www.springer.com|
|Order Information:||Web: 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.:
- repec:dgr:rugsom:03a30 is not listed on IDEAS
- 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.
- 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).
When requesting a correction, please mention this item's handle: RePEc:spr:jglopt:v:53:y:2012:i:3:p:475-495. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla)or (Rebekah McClure)
If references are entirely missing, you can add them using this form.