Adar A. Kalir, Subhash C. Sarin Constructing Near Optimal Schedules for the Flow-Shop Lot Streaming Problem with Sublot-Attached Setups. [Citation Graph (0, 0)][DBLP] J. Comb. Optim., 2003, v:7, n:1, pp:23-44 [Journal]
Sachin B. Patkar, H. Narayanan Fast On-Line/Off-Line Algorithms for Optimal Reinforcement of a Network and its Connections with Principal Partition. [Citation Graph (0, 0)][DBLP] J. Comb. Optim., 2003, v:7, n:1, pp:45-68 [Journal]
Chiuyuan Chen Any Maximal Planar Graph with Only One Separating Triangle is Hamiltonian. [Citation Graph (0, 0)][DBLP] J. Comb. Optim., 2003, v:7, n:1, pp:79-86 [Journal]