6533b872fe1ef96bd12d3735

RESEARCH PRODUCT

Linear Programming Based Methods for Solving Arc Routing Problems

Enrique BenaventÁNgel CorberánJosé M. Sanchis

subject

Mathematical optimizationRoute inspection problemLinear programmingComputer scienceCombinatorial optimization problemResolution (logic)Arc routing

description

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 Junger, 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.

yearjournalcountryeditionlanguage
2000-01-01
https://doi.org/10.1007/978-1-4615-4495-1_7