Packing squares independently
Authors:
- Wei WuWWWei Wu
- Hiroki NumaguchiHNHiroki Numaguchi
- 16 October 2024
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 1024
Abstract
No abstract availableKeywords
Funding Information
- United States-Israel Binational Science Foundation
- Israel Science Foundation
- Japan Society for the Promotion of Science
This publication has 16 references indexed in Scilit:
- Knapsack problems with position-dependent item weights or profitsAnnals of Operations Research, 2023
- Strongly Polynomial FPTASes for Monotone Dynamic ProgramsAlgorithmica, 2022
- The rectangular two-dimensional strip packing problem real-life practical constraints: A bibliometric overviewComputers & Operations Research, 2022
- Convex relaxations of non-convex mixed integer quadratically constrained programs: extended formulationsMathematical Programming, 2010
- An iterated local search algorithm for the vehicle routing problem with convex time penalty functionsDiscrete Applied Mathematics, 2008
- An improved typology of cutting and packing problemsEuropean Journal of Operational Research, 2007
- A branch-and-price algorithm for the two-dimensional level strip packing problem4OR, 2007
- Improved local search algorithms for the rectangle packing problem with general spatial costsEuropean Journal of Operational Research, 2005
- Local search algorithms for the rectangle packing problem with general spatial costsMathematical Programming, 2003
- A typology of cutting and packing problemsEuropean Journal of Operational Research, 1990