Oper. Res. Lett. - researchr journal

499	--	509	Andrew B. Kahng, Sherief Reda. Match twice and stitch: a new TSP tour construction heuristic
510	--	516	Dimitris Bertsimas, Dessislava Pachamanova, Melvyn Sim. Robust linear optimization under general norms
517	--	522	Wanpracha Art Chaovalitwongse, Panos M. Pardalos, Oleg A. Prokopyev. A new linearization technique for multi-quadratic 0-1 programming problems
523	--	529	Marco Locatelli, Immanuel M. Bomze, Marcello Pelillo. The combinatorics of pivoting for the maximum weight clique
530	--	534	Asaf Levin. Strongly polynomial-time approximation for a class of bicriteria problems
535	--	539	Rob van Stee. An approximation algorithm for square packing
540	--	546	Reuven Bar-Yehuda, Dror Rawitz. Local ratio with negative weights
547	--	556	Jesper Makholm Byskov. Enumerating maximal independent sets with applications to graph colouring
557	--	564	Alix Munier Kordon. Minimizing makespan for a bipartite graph on a single processor with an integer precedence delay
565	--	573	Bas van Velzen. Dominating set games
574	--	580	Bong Dae Choi, Bara Kim. Non-ergodicity criteria for denumerable continuous time Markov processes
581	--	590	Chung-Yee Lee. Inventory replenishment model: lot sizing versus just-in-time delivery
591	--	594	Uriel G. Rothblum. Tales of Hoffman

External Links