You have Guest access.
Log In
Volume 1 / 1997 - Volume 23 / 2012
Special Issue
241-257
A Lagrangian bound for many-to-many assignment problems
Igor Litvinchev, Socorro Rangel and Jania Saucedo
258-278
The price of atomic selfish ring routing
Bo Chen, Xujin Chen and Xiaodong Hu
279-303
Keeping partners together: algorithmic results for the hospitals/residents problem with couples
Eric J. McDermid and David F. Manlove
304-324
Algorithms for storage allocation based on client preferences
Tami Tamir and Benny Vaksendiser
325-346
Scheduling internal audit activities: a stochastic combinatorial optimization problem
Roberto Rossi, S. Armagan Tarim, Brahim Hnich, Steven Prestwich and Semra Karacaer
347-368
Just-in-time scheduling with controllable processing times on parallel machines
Yaron Leyvand, Dvir Shabtay, George Steiner and Liron Yedidsion
369-393
A fast exact algorithm for the problem of optimum cooperation and the structure of its solutions
Diana Fanghänel and Frauke Liers
394-414
An effective algorithm for obtaining the whole set of minimal cost pairs of disjoint paths with dual arc costs
T. Gomes, J. Craveirinha and L. Jorge
415-427
Galaxy cutsets in graphs
Nicolas Sonnerat and Adrian Vetta
Frequently asked questions General info on journals and books Send us your feedback Impressum Contact us
© Springer, Part of Springer Science+Business Media Privacy, Disclaimer, Terms & Conditions, and Copyright Info