• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 34 matches

• 2020
• 
  Igor Pejic, Daan van den Berg:
  Monte carlo tree search on perfect rectangle packing problem instances. GECCO Companion 2020: 1697-1703
• 2019
• 
  Quoc Trung Bui, Thibaut Vidal, Minh Hoàng Hà:
  On three soft rectangle packing problems with guillotine constraints. J. Glob. Optim. 74(1): 45-62 (2019)
• 2018
• 
  Kotaro Terada, Daisuke Oku, Sho Kanamaru, Shu Tanaka, Masato Hayashi, Masanao Yamaoka, Masao Yanagisawa, Nozomu Togawa:
  An Ising model mapping to solve rectangle packing problem. VLSI-DAT 2018: 1-4
• 2017
• 
  Lei Wu, Xue Tian, Jixu Zhang, Qi Liu, Wensheng Xiao, Yaowen Yang:
  An improved heuristic algorithm for 2D rectangle packing area minimization problems with central rectangles. Eng. Appl. Artif. Intell. 66: 1-16 (2017)
• 
  Salvatore Ingala:
  Approximation Algorithms for Rectangle Packing Problems (PhD Thesis). CoRR abs/1711.07851 (2017)
• 2016
• 
  Lei Wu, Liang Zhang, Wensheng Xiao, Qi Liu, Chao Mu, Yaowen Yang:
  A novel heuristic algorithm for two-dimensional rectangle packing area minimization problem with central rectangle. Comput. Ind. Eng. 102: 208-218 (2016)
• 
  Rui Zhao, Guihe Qin, Jia-qiao Liu:
  A rectangle bin packing optimization approach to the signal scheduling problem in the FlexRay static segment. Frontiers Inf. Technol. Electron. Eng. 17(4): 375-388 (2016)
• 
  Amandeep Kaur Virk, Kawaljeet Singh:
  Solving Multi-objective Two Dimensional Rectangle Packing Problem. SocProS (2) 2016: 188-196
• 2015
• 
  Kun He, Pengli Ji, Chumin Li:
  Dynamic reduction heuristics for the rectangle packing area minimization problem. Eur. J. Oper. Res. 241(3): 674-685 (2015)
• 2014
• 
  Haiming Liu, Jiong Zhou, Xinsheng Wu, Peng Yuan:
  Optimization algorithm for rectangle packing problem based on varied-factor genetic algorithm and lowest front-line strategy. IEEE Congress on Evolutionary Computation 2014: 352-357
• 2013
• 
  Andreas Bortfeldt:
  A reduction approach for solving the rectangle packing area minimization problem. Eur. J. Oper. Res. 224(3): 486-496 (2013)
• 
  Ziqiang Li, Bowen Song, Xianfeng Wang, Ruopeng Li:
  A heuristic ant colony approach for the circle and rectangle packing problems with rotary inertia constraints. ICNC 2013: 460-465
• 
  Ziqiang Li, Xianfeng Wang, Bowen Song, Nannan Sun:
  A divide-conquer quasi-physical and quasi-human algorithm for the circle and rectangle orthogonal packing problem with equilibrium constraints. ICNC 2013: 364-368
• 2012
• 
  Wenqi Huang, Tao Ye, Duanbing Chen:
  Corner occupying theorem for the two-dimensional integral rectangle packing problem. Sci. China Inf. Sci. 55(11): 2466-2472 (2012)
• 2011
• 
  Wenshui Lin, Jinping Xu, Jiandong Wang, Xinyou Wu:
  A Bricklaying Best-Fit Heuristic Algorithm for the Orthogonal Rectangle Packing Problem. ICAIC (2) 2011: 638-643
• 
  Wenqi Huang, Tao Ye, Duanbing Chen:
  Corner Occupying Theorem for the Two-dimensional Integral Rectangle Packing Problem. CoRR abs/1111.3715 (2011)
• 2009
• 
  Miroslav Chlebík, Janka Chlebíková:
  Hardness of approximation for orthogonal rectangle packing and covering problems. J. Discrete Algorithms 7(3): 291-305 (2009)
• 
  David Beltrán-Cano, Belén Melián-Batista, J. Marcos Moreno-Vega:
  Solving the Rectangle Packing Problem by an Iterative Hybrid Heuristic. EUROCAST 2009: 673-680
• 
  Genhong Ding, Dan Li, Leng Chen:
  Solving the packing problem of rectangles with improved genetic algorithm based on statistical analysis. GEC Summit 2009: 819-822
• 2007
• 
  Duanbing Chen, Wenqi Huang:
  A New Heuristic Algorithm for Constrained Rectangle-Packing Problem. Asia Pac. J. Oper. Res. 24(4): 463-478 (2007)
• 
  Wenqi Huang, Duanbing Chen:
  An efficient heuristic algorithm for rectangle-packing problem. Simul. Model. Pract. Theory 15(10): 1356-1365 (2007)
• 2006
• 
  Kathryn A. Dowsland, Edward A. Herbert, Graham Kendall, Edmund K. Burke:
  Using tree search bounds to enhance a genetic algorithm approach to two rectangle packing problems. Eur. J. Oper. Res. 168(2): 390-402 (2006)
• 
  Miroslav Chlebík, Janka Chlebíková:
  Inapproximability Results for Orthogonal Rectangle Packing Problems with Rotations. CIAC 2006: 199-210
• 
  Toshihide Ibaraki, Kouji Nakamura:
  Packing Problems with Soft Rectangles. Hybrid Metaheuristics 2006: 13-27
• 
  Janka Chlebíková, Miroslav Chlebík:
  Hardness of asymptotic approximation for orthogonal rectangle packing and covering problems. Electron. Colloquium Comput. Complex.(019) (2006)
• 2005
• 
  Shinji Imahori, Mutsunori Yagiura, Toshihide Ibaraki:
  Improved local search algorithms for the rectangle packing problem with general spatial costs. Eur. J. Oper. Res. 167(1): 48-67 (2005)
• 2003
• 
  Shinji Imahori, Mutsunori Yagiura, Toshihide Ibaraki:
  Local search algorithms for the rectangle packing problem with general spatial costs. Math. Program. 97(3): 543-569 (2003)
• 
  Massimiliano Caramia, Stefano Giordani, Antonio Iovanella:
  An On-Line Algorithm for the Rectangle Packing Problem with Rejection. WEA 2003: 59-69
• 2002
• 
  Yu-Liang Wu, Wenqi Huang, Siu-Chung Lau, C. K. Wong, Gilbert H. Young:
  An effective quasi-human based heuristic for solving the rectangle packing problem. Eur. J. Oper. Res. 141(2): 341-358 (2002)
• 2001
• 
  Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan, Suneeta Ramaswami:
  Efficient Approximation Algorithms for Tiling and Packing Problems with Rectangles. J. Algorithms 41(2): 443-470 (2001)

skipping 4 more matches