Integer programming and combinatorial optimization. 9th international IPCO conference, Cambridge, MA, USA, May 27--29, 2002. Proceedings

DOI10.1007/3-540-47867-1zbMath0992.00060OpenAlexW4302308518MaRDI QIDQ1611716

No author found.

Publication date: 27 August 2002

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-47867-1

zbMATH Keywords

ConferenceProceedingsInteger programmingCombinatorial optimizationIPCO conferenceCambridge, MA (USA)

Mathematics Subject Classification ID

Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming (90-06)

Related Items (1)

DECOMPOSITION ALGORITHMS TO COMPUTE THE QUICKEST TIME DISTRIBUTION IN DYNAMIC NETWORKS

This page was built for publication: Integer programming and combinatorial optimization. 9th international IPCO conference, Cambridge, MA, USA, May 27--29, 2002. Proceedings