Recognizing integrality of weighted rectangles partitions
From MaRDI portal
Cites work
- A decomposition theory for matroids. V: Testing of matrix total unimodularity
- A near-optimal solution to a two-dimensional cutting stock problem
- A polynomial recognition algorithm for balanced matrices
- Approximation schemes for maximum weight independent set of rectangles
- Balanced matrices
- Coloring and Maximum Weight Independent Set of Rectangles
- Communication Complexity
- Decomposition of balanced matrices
- scientific article; zbMATH DE number 3557519 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1234104 (Why is no real title available?)
- scientific article; zbMATH DE number 3327126 (Why is no real title available?)
- Implementation of a unimodularity test
- Integer linear programming models for 2-staged two-dimensional knapsack problems
- Integer Programming
- Integral boundary points of convex polyhedra
- Maximum independent set of rectangles
- Minimum dissection of a rectilinear polygon with arbitrary holes into rectangles
- Multistage Cutting Stock Problems of Two and More Dimensions
- Perfect zero–one matrices
- Set Partitioning: A survey
- The NP-completeness column: an ongoing guide
- Two-dimensional packing problems: a survey
This page was built for publication: Recognizing integrality of weighted rectangles partitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7020747)
