scientific article; zbMATH DE number 1305407
From MaRDI portal
Publication:4252288
zbMath0938.68067MaRDI QIDQ4252288
Chandra Chekuri, Sanjeev Khanna
Publication date: 21 June 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Polynomial time approximation schemes for class-constrained packing problems ⋮ A two-dimensional vector packing model for the efficient use of coil cassettes ⋮ A hybrid MIP-based large neighborhood search heuristic for solving the machine reassignment problem ⋮ Vector bin packing with heterogeneous bins: application to the machine reassignment problem ⋮ Approximate composable truthful mechanism design ⋮ Approximate Truthful Mechanism Design for Two-Dimensional Orthogonal Knapsack Problem ⋮ On the weak computability of a four dimensional orthogonal packing and time scheduling problem ⋮ Approximate strong separation with application in fractional graph coloring and preemptive scheduling. ⋮ Constraint programming for planning test campaigns of communications satellites ⋮ Mixed-criticality scheduling on multiprocessors ⋮ Lower bounds and algorithms for the 2-dimensional vector packing problem ⋮ Vector assignment schemes for asymmetric settings ⋮ Hardness of approximation for orthogonal rectangle packing and covering problems ⋮ On minimizing the makespan when some jobs cannot be assigned on the same machine ⋮ An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing
