A Lagrangian bound for many-to-many assignment problems (English)
- New search for: Litvinchev, I.
- New search for: Rangel, S.
- New search for: Saucedo, J.
- New search for: Litvinchev, I.
- New search for: Rangel, S.
- New search for: Saucedo, J.
In:
JOURNAL OF COMBINATORIAL OPTIMIZATION
;
19
, 3
;
241-257
;
2010
-
ISSN:
- Article (Journal) / Print
-
Title:A Lagrangian bound for many-to-many assignment problems
-
Contributors:
-
Published in:JOURNAL OF COMBINATORIAL OPTIMIZATION ; 19, 3 ; 241-257
-
Publisher:
- New search for: Springer Science + Business Media
-
Publication date:2010-01-01
-
Size:17 pages
-
ISSN:
-
Type of media:Article (Journal)
-
Type of material:Print
-
Language:English
- New search for: 511.6
- Further information on Dewey Decimal Classification
-
Classification:
DDC: 511.6 -
Source:
© Metadata Copyright the British Library Board and other contributors. All rights reserved.
Table of contents – Volume 19, Issue 3
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 241
-
A Lagrangian bound for many-to-many assignment problemsLitvinchev, Igor / Rangel, Socorro / Saucedo, Jania et al. | 2008
- 258
-
The price of atomic selfish ring routingChen, Bo / Chen, Xujin / Hu, Xiaodong et al. | 2008
- 279
-
Keeping partners together: algorithmic results for the hospitals/residents problem with couplesMcDermid, Eric J. / Manlove, David F. et al. | 2009
- 304
-
Algorithms for storage allocation based on client preferencesTamir, Tami / Vaksendiser, Benny et al. | 2009
- 325
-
Scheduling internal audit activities: a stochastic combinatorial optimization problemRossi, Roberto / Tarim, S. Armagan / Hnich, Brahim / Prestwich, Steven / Karacaer, Semra et al. | 2009
- 347
-
Just-in-time scheduling with controllable processing times on parallel machinesLeyvand, Yaron / Shabtay, Dvir / Steiner, George / Yedidsion, Liron et al. | 2009
- 369
-
A fast exact algorithm for the problem of optimum cooperation and the structure of its solutionsFanghänel, Diana / Liers, Frauke et al. | 2009
- 394
-
An effective algorithm for obtaining the whole set of minimal cost pairs of disjoint paths with dual arc costsGomes, T. / Craveirinha, J. / Jorge, L. et al. | 2009
- 415
-
Galaxy cutsets in graphsSonnerat, Nicolas / Vetta, Adrian et al. | 2009