A branch-and-cut algorithm for the target visitation problem

Achim Hildenbrandt

Year of publication:	2019
Authors:	Hildenbrandt, Achim
Published in:	EURO journal on computational optimization. - Heidelberg : Springer, ISSN 2192-4406, ZDB-ID 2772752-X. - Vol. 7.2019, 3, p. 209-242
Subject:	Traveling salesman problem \| Linear ordering problem \| Polyhedra theory \| Branch-and-cut \| Theorie \| Theory \| Algorithmus \| Algorithm \| Tourenplanung \| Vehicle routing problem \| Rundreiseproblem \| Travelling salesman problem \| Mathematische Optimierung \| Mathematical programming

Online Resource

Check full text access |

More access options

Check Google Scholar

In libraries world-wide (WorldCat)

In German libraries (KVK)

Which error do you want to report?

Report: URL of this record is broken

Please note: Sometimes more than one URL is available for a resource. Please click on "More Options" to display these URLs

Report: Addition of an URL to that resource

Please note: Sometimes more than one URL is available for a resource. Please click on "More Options" to display these URLs

Report: The language(s) of that resource is/are…

Please note: Required language not in the list? Please use comment field

Report: Addition of an identifier to that resource

Report: report typo

Report: Add statement

Report: Add keywords

Please use the commentary box to describe other errors

Would you like to receive a feedback?

Commentary

Please type the code from the image

For general questions please use this address.

Persistent link: https://www.econbiz.de/10012313999

A service of the