Search results for "Combinatorial optimization problem"

showing 1 items of 11 documents

Linear Programming Based Methods for Solving Arc Routing Problems

2000

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.

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