1985•European Journal of Operational ResearchRequires access

A cutting plane procedure for the travelling salesman problem on road networks

Bernhard Fleischmann

Open publisher page 87 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

OpenAlex reports 87 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Key concepts: Travelling salesman problem, Cutting-plane method, Integer programming, Mathematical optimization, Plane (geometry), Computer science, Cutting stock problem, Linear programming

Back to paper search Browse research topics Original source

A cutting plane procedure for the travelling salesman problem on road networks — Research Paper | ScholarLens