A constraint programming approach to the Chinese postman problem with time windows
From MaRDI portal
Publication:2496043
DOI10.1016/j.cor.2005.02.012zbMath1094.90033OpenAlexW2020522552MaRDI QIDQ2496043
U. F. Aminu, Richard W. Eglese
Publication date: 30 June 2006
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2005.02.012
time windowsconstraint programmingvehicle routing problemsarc routing problemsChinese postman problems
Minimax problems in mathematical programming (90C47) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27)
Related Items
Solving the time varying postman problems with timed automata, A hybrid heuristic procedure for the windy rural postman problem with zigzag time windows, Shortest path problems with left-side time windows, Arc routing problems: A review of the past, present, and future, The mixed capacitated general routing problem with <scp>time‐dependent</scp> demands, Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics, The windy rural postman problem with a time-dependent zigzag option, Combinatorial optimization and green logistics, Counting feasible solutions of the traveling salesman problem with pickups and deliveries is \#\(P\)-complete, Solving the mobile mapping van problem: a hybrid metaheuristic for capacitated arc routing with soft time windows, Combinatorial optimization and green logistics, Recent results on Arc Routing Problems: An annotated bibliography, An integer programming approach for the Chinese postman problem with time-dependent travel time
Cites Work
