Packing squares independently

DOI10.1016/J.TCS.2024.114910MaRDI QIDQ6652453

Hiroki Numaguchi, Nir Halman, Wei Wu, Y. Hu, Mutsunori Yagiura

Publication date: 12 December 2024

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

complexitydynamic programmingstrip packingfully polynomial-time approximation scheme

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Approximation algorithms (68W25) Combinatorial aspects of packing and covering (05B40)

Cites Work

• Title not available (Why is that?)
• An iterated local search algorithm for the vehicle routing problem with convex time penalty functions
• A branch-and-price algorithm for the two-dimensional level strip packing problem
• Local search algorithms for the rectangle packing problem with general spatial costs
• A typology of cutting and packing problems
• Two-dimensional packing problems: a survey
• Models and bounds for two-dimensional level packing problems
• Strongly polynomial FPTASes for monotone dynamic programs
• Improved local search algorithms for the rectangle packing problem with general spatial costs
• Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
• An improved typology of cutting and packing problems
• The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview
• A Fully Polynomial-Time Approximation Scheme for Single-Item Stochastic Inventory Control with Discrete Demand
• Fully Polynomial Time Approximation Schemes for Stochastic Dynamic Programs
• Knapsack problems with position-dependent item weights or profits

This page was built for publication: Packing squares independently

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6652453)