Volume 57, Number 1, January 2011 Optimization in Scheduled Transportation Networks
Volume 57, Number 2, March 2011
, Erfang Shan
: A note on the upper bound for the paired-domination number of a graph with minimum degree at least two.
: Stackelberg network pricing is hard to approximate.
, Zhaohui Liu
: Single-vehicle scheduling problems with release and service times on a line.
: A minimum cost flow formulation for approximated MLC segmentation.
Volume 57, Number 3, May 2011 Seventh Cologne-Twente Workshop
Volume 57, Number 4, July 2011
: Finding hidden hubs and dominating sets in sparse graphs by randomized neighborhood queries.
: Finding integer efficient solutions for multiple objective network programming problems.