397 | -- | 398 | Bernhard Haeupler, Robert Endre Tarjan. Finding a feasible flow in a strongly connected network |
399 | -- | 401 | Joseph Cheriyan, Howard J. Karloff, Rohit Khandekar, Jochen Könemann. On the integrality ratio for tree augmentation |
402 | -- | 407 | Santosh N. Kabadi, Abraham P. Punnen. A strongly polynomial simplex method for the linear fractional assignment problem |
408 | -- | 413 | Ulrich Brenner. A faster polynomial algorithm for the unbalanced Hitchcock transportation problem |
414 | -- | 418 | Eissa Nematollahi, Tamás Terlaky. A redundant Klee-Minty construction with all the redundant constraints touching the feasible region |
419 | -- | 423 | Anna Galluccio, Claudio Gentile, Paolo Ventura. Gear composition and the stable set polytope |
424 | -- | 429 | Bruno Escoffier, Jérôme Monnot, Olivier Spanjaard. Some tractable instances of interval data minmax regret problems |
430 | -- | 433 | Christoph Buchheim, Frauke Liers, Marcus Oswald. Local cuts revisited |
434 | -- | 438 | Oleg V. Shylo, Oleg A. Prokopyev, Vladimir Shylo. Solving weighted MAX-SAT via global equilibrium search |
439 | -- | 443 | Jon Lee, Shmuel Onn, Robert Weismantel. On test sets for nonlinear integer maximization |
444 | -- | 449 | Nikolaos Papadakos. Practical enhancements to the Magnanti-Wong method |
450 | -- | 455 | A. B. Philpott, Z. Guan. On the convergence of stochastic dual dynamic programming and related methods |
456 | -- | 460 | Chen Ling, Liqun Qi, Guanglu Zhou, Louis Caccetta. The SC |
461 | -- | 464 | Didier Aussel, Joydeep Dutta. Generalized Nash equilibrium problem, variational inequality and quasiconvexity |
465 | -- | 470 | Wilco van den Heuvel, Albert P. M. Wagelmans. Four equivalent lot-sizing models |
471 | -- | 476 | Sigrid Knust. Scheduling sports tournaments on a single court minimizing waiting times |
477 | -- | 480 | Lingfa Lu, Jinjiang Yuan. Unbounded parallel batch scheduling with job delivery to minimize makespan |
481 | -- | 483 | Oded Berman, Zvi Drezner. A new formulation for the conditional p |
484 | -- | 491 | Daniel Adelman. A simple algebraic approximation to the Erlang loss system |
492 | -- | 495 | Dimitrios G. Pandelis. Optimal stochastic scheduling of two interconnected queues with varying service rates |
496 | -- | 499 | P. Moyal. Convex comparison of service disciplines in real time queues |
500 | -- | 505 | Robert D. van der Mei, Erik M. M. Winands. A note on polling models with renewal arrivals and nonzero switch-over times |
506 | -- | 512 | Youyi Feng, Jihong Ou, Zhan Pang. Optimal control of price and production in an assemble-to-order system |
513 | -- | 514 | Dries R. Goossens. Peter Cramton, Yoav Shoham and Richard Steinberg, Editors, Combinatorial Auctions, MIT Press, Cambridge, Massachusetts & London, England (2006) ISBN 0-262-03342-9, p. 669 |