A Cutting Plane Heuristic Algorithm for the Time Dependent Chinese Postman Problem.

Jinghao Sun Yakun Meng Guozhen Tan

Published in: FAW-AAIM (2013)

Keyphrases

cutting plane
cutting plane algorithm
integer programming
column generation
lower bound
mixed integer linear programming
mixed integer
integer program
knapsack problem
travel time
valid inequalities
np hard
upper bound
exact penalty