Computers & Operations Research（COR ）的VOLUME 33, ISSUE 12论文列表

卷期号： Volume 33, Issue 12

发布时间： December 2006

卷期年份： 2006

卷期官网： https://www.sciencedirect.com/journal/computers-and-operations-research/vol/33/issue/12

Title Page/Editorial Board

Recent algorithmic advances for Arc Routing Problems

Lower and upper bounds for the mixed capacitated arc routing problem

A comparison of two different formulations for arc routing problems on mixed graphs

A tabu search algorithm for the min–max k-Chinese postman problem

A constraint programming approach to the Chinese postman problem with time windows

Privatized rural postman problems

A constructive heuristic for the Undirected Rural Postman Problem

New lower bound for the Capacitated Arc Routing Problem

A genetic algorithm for a bi-objective capacitated arc routing problem

Road network monitoring: algorithms and a case study

A Road TimetableTM to aid vehicle routing and scheduling

Experimental Analysis of Approximation Algorithms for the Vertex Cover and Set Covering Problems

Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization

Variable neighborhood search for the linear ordering problem

Euclidean push–pull partial covering problems

An efficient dynamic programming algorithm for a special case of the capacitated lot-sizing problem

Multi-item dynamic production-distribution planning in process industries with divergent finishing stages

Waste collection vehicle routing problem with time windows

Volume contents and author index