Almost Square Packing
The almost square rectangle packing problem involves packing all rectangles with sizes 1 ×2 to n ×(n + 1) (almost squares) into an enclosing rectangle of minimal area. This extends the previously studied square packing problem by adding an additional degr
- PDF / 3,853,862 Bytes
- 261 Pages / 429.442 x 659.895 pts Page_size
- 4 Downloads / 193 Views
Editorial Board David Hutchison Lancaster University, UK Takeo Kanade Carnegie Mellon University, Pittsburgh, PA, USA Josef Kittler University of Surrey, Guildford, UK Jon M. Kleinberg Cornell University, Ithaca, NY, USA Alfred Kobsa University of California, Irvine, CA, USA Friedemann Mattern ETH Zurich, Switzerland John C. Mitchell Stanford University, CA, USA Moni Naor Weizmann Institute of Science, Rehovot, Israel Oscar Nierstrasz University of Bern, Switzerland C. Pandu Rangan Indian Institute of Technology, Madras, India Bernhard Steffen TU Dortmund University, Germany Madhu Sudan Microsoft Research, Cambridge, MA, USA Demetri Terzopoulos University of California, Los Angeles, CA, USA Doug Tygar University of California, Berkeley, CA, USA Gerhard Weikum Max Planck Institute for Informatics, Saarbruecken, Germany
6697
Tobias Achterberg J. Christopher Beck (Eds.)
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems 8th International Conference, CPAIOR 2011 Berlin, Germany, May 23-27, 2011 Proceedings
13
Volume Editors Tobias Achterberg Zuse Institut Berlin Takustr. 7 14195 Berlin, Germany E-mail: [email protected] J. Christopher Beck University of Toronto Department of Mechanical and Industrial Engineering 5 King’s College Rd. Toronto, ON, M5S 3G8, Canada E-mail: [email protected]
ISSN 0302-9743 e-ISSN 1611-3349 ISBN 978-3-642-21310-6 e-ISBN 978-3-642-21311-3 DOI 10.1007/978-3-642-21311-3 Springer Heidelberg Dordrecht London New York Library of Congress Control Number: Applied for CR Subject Classification (1998): G.1.6, G.1, G.2.1, F.2.2, I.2, J.1 LNCS Sublibrary: SL 1 – Theoretical Computer Science and General Issues
© Springer-Verlag Berlin Heidelberg 2011 This work is subject to copyright. All rights are reserved, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, re-use of illustrations, recitation, broadcasting, reproduction on microfilms or in any other way, and storage in data banks. Duplication of this publication or parts thereof is permitted only under the provisions of the German Copyright Law of September 9, 1965, in its current version, and permission for use must always be obtained from Springer. Violations are liable to prosecution under the German Copyright Law. The use of general descriptive names, registered names, trademarks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. Typesetting: Camera-ready by author, data conversion by Scientific Publishing Services, Chennai, India Printed on acid-free paper Springer is part of Springer Science+Business Media (www.springer.com)
Preface
The 8th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2011) was held in Berlin, Germany, May 23–27, 2011. The conference is intended primarily as a forum to foc
Data Loading...
