Skip to main content
Book Chapter

Linear Programming Based Methods for Solving Arc Routing Problems

  • Benavent E
  • Corberán A
  • Sanchis J
Springer US, (2000), 231-275
DOI: 10.1007/978-1-4615-4495-1_7
N/ACitations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

From the pioneering works of Dantzig, Edmonds and others, polyhedral (i.e. linear programming based) methods have been successfully applied to the resolution of many combinatorial optimization problems. See Jünger, Reinelt & Rinaldi (1995) for an excellent survey on this topic. Roughly speaking, the method consists of trying to formulate the problem as a Linear Program and using the existing powerful methods of Linear Programming to solve it.

Cite

CITATION STYLE

APA

Benavent, E., Corberán, A., & Sanchis, J. M. (2000). Linear Programming Based Methods for Solving Arc Routing Problems. In Arc Routing (pp. 231–275). Springer US. https://doi.org/10.1007/978-1-4615-4495-1_7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free