141 | -- | 149 | Sophie Dewez, Martine Labbé, Patrice Marcotte, Gilles Savard. New formulations and valid inequalities for a bilevel pricing problem |
150 | -- | 156 | Michael R. Wagner. Stochastic 0-1 linear programming under limited distributional information |
157 | -- | 159 | Hans Kellerer. An approximation algorithm for identical parallel machine scheduling with resource dependent processing times |
160 | -- | 164 | Eitan Altman, Konstantin Avrachenkov, Nicolas Bonneau, Mérouane Debbah, Rachid El Azouzi, Daniel Sadoc Menasché. Constrained cost-coupled stochastic games with independent state processes |
165 | -- | 167 | Jayavel Sounderpandian. Totally monotonic games and flow games |
168 | -- | 172 | Jacques Laye, Maximilien Laye. Uniqueness and characterization of capacity constrained Cournot-Nash equilibrium |
173 | -- | 176 | Nicolae Popovici. Involving the Helly number in Pareto reducibility |
177 | -- | 183 | Bong-Gyu Jang, Gyoocheol Shim. A reflected diffusion process in a regime-switching environment |
184 | -- | 188 | Maria Estrella Sousa Vieira, Andrés Suárez-González, José C. López-Ardao, Cándido López-García, Manuel Fernández-Veiga. On improving the efficiency of an M/G/infinity generator of correlated traces |
189 | -- | 195 | Zhaotong Lian, Liming Liu. A tandem network with MAP inputs |
196 | -- | 200 | Mohammed Abbad, Tariq Zahratahdi. An algorithm for achieving proportional delay differentiation |
201 | -- | 204 | Sunggon Kim, Jongho Bae. A G/M/1 queueing system with P::lambda:::::M:::-service policy |
205 | -- | 210 | Dimitris Bertsimas, Xuan Vinh Doan, Jean B. Lasserre. Approximating integrals of multivariate exponentials: A moment approach |
211 | -- | 214 | Song Wang, Xiaoqi Yang. A power penalty method for linear complementarity problems |
215 | -- | 222 | Antoine Deza, Tamás Terlaky, Yuriy Zinchenko. Polytopes and arrangements: Diameter and curvature |
223 | -- | 228 | Javier Peña, Juan Carlos Vera, Luis F. Zuluaga. Exploiting equalities in polynomial programming |
229 | -- | 233 | Dorit S. Hochbaum, Erick Moreno-Centeno. The inequality-satisfiability problem |
234 | -- | 238 | Ismael R. de Farias Jr., Ming Zhao, Hai Zhao. A special ordered set approach for optimizing a discontinuous separable piecewise linear function |
239 | -- | 242 | Brahim Chaourar. On the Kth best base of a matroid |
243 | -- | 246 | Refael Hassin, Ariel Keinan. Greedy heuristics with regret, with application to the cheapest insertion algorithm for the TSP |
247 | -- | 249 | Sven Oliver Krumke, Anne Schwahn, Rob van Stee, Stephan Westphal. A monotone approximation algorithm for scheduling with precedence constraints |
250 | -- | 254 | Zhiyi Tan, Shaohua Yu. Online scheduling with reassignment |
255 | -- | 258 | Ruyan Fu, Ji Tian, Jinjiang Yuan, Cheng He. On-line scheduling on a batch machine to minimize makespan with limited restarts |
259 | -- | 264 | Serhan Duran, Tieming Liu, David Simchi-Levi, Julie L. Swann. Policies utilizing tactical inventory for service-differentiated customers |
265 | -- | 270 | Mingzhou Jin, Kai Liu, Burak Eksioglu. A column generation approach for the split delivery vehicle routing problem |
271 | -- | 275 | Eduardo Conde. A note on the minmax regret centdian location on trees |
276 | -- | 277 | Michael Trick. David L. Applegate, Robert E. Bixby, Vasek Chvátal , William J. Cook. The Traveling Salesman Problem: A Computational Study, Princeton University Press, Princeton, 2007, ISBN-13: 978-0-691-12993-8, 606 pp |
277 | -- | 278 | Patric R. J. ÖstergÃ¥rd. P.G. Szabó, M.C. Markót, T. Csendes, E. Specht, L.G. Casado, I. GarcÃa, New Approaches to Circle Packing in a Square, Springer, Berlin, 2007, ISBN: 978-0-387-45673-7, pp 238 |