✦ LIBER ✦

A cutting plane algorithm for the General Routing Problem

✍ Scribed by Angel Corberáan; Adam N. Letchford; José María Sanchis

Publisher: Springer-Verlag
Year: 2001
Tongue: English
Weight: 233 KB
Volume: 90
Category: Article
ISSN: 0025-5610
DOI: 10.1007/pl00011426

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A cutting plane algorithm for the biline

A cutting plane algorithm for the bilinear programming problem

✍ H. Vaish; C. M. Shetty 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 731 KB

Algorithm for solving the problem of a p

Algorithm for solving the problem of a plane cutting layout

✍ A. B. Gribov 📂 Article 📅 1975 🏛 Springer US 🌐 English ⚖ 435 KB

A central cutting plane algorithm for th

A central cutting plane algorithm for the convex programming problem

✍ Jack Elzinga; Thomas G. Moore 📂 Article 📅 1975 🏛 Springer-Verlag 🌐 English ⚖ 496 KB

A branch & cut algorithm for the windy g

A branch & cut algorithm for the windy general routing problem and special cases

✍ Angel Corberán; Isaac Plana; José M. Sanchis 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 201 KB 👁 1 views

## Abstract In this paper, we present an exact algorithm for the Windy General Routing Problem. This problem generalizes many important Arc Routing Problems and also has some interesting real‐life applications. The Branch & Cut method presented here is based on a cutting‐plane algorithm that identi

Bounds for the general capacitated routi

Bounds for the general capacitated routing problem

✍ Klaus Jansen 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 669 KB

Cutting plane algorithms for the inverse

Cutting plane algorithms for the inverse mixed integer linear programming problem

✍ Lizhi Wang 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 677 KB