Computers & OR - researchr journal

871	--	881	Laura Burke, Seth Flanders. Using ontogenic classification networks in a smart structures application
883	--	892	Anito Joseph. Parametric formulation of the general integer linear programming problem
893	--	903	Saul I. Gass, Pablo M. R. Zafra. Modified fictitious play for solving matrix games and linear-programming problems
905	--	914	I. Douglas Moon, Lee Papayanopoulos. Facility location on a tree with maximum distance constraints
915	--	920	Klaus Jansen, Gerhard J. Woeginger, Zhongliang Yu. UET-scheduling with chain-type precedence constraints
921	--	934	Lloyd W. Clarke, G. Anandalingam. A bootstrap heuristic for designing minimum cost survivable networks
935	--	946	M. N. Gopalan, S. Kannan. Expected number analysis of a two-server queueing network subject to inter-stage inspection and rework
947	--	958	Susan X. Li, Zhimin Huang. Managing buyer-seller system cooperation with quantity discount considerations
959	--	970	Luis Gouveia. Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with hop constraints
971	--	983	Herminia I. Calvete, Pedro M. Mateo. An approach for the network flow problem with multiple objectives

External Links