Oriented aligned rectangle packing problem

Article Abstract:

An alternative formulation for the rectangle packing problem is proposed along with two efficient algorithms which are applied to special cases. The O(n) and O(n squared) time algorithms can be adapted to derive other cost functions. The study has not established the complexity of the oriented aligned rectangle packing problem and recommends further study on the subject.

Packaging

---

The canonical order and greedy algorithms

Article Abstract:

A class of objective functions and a class of polyhedral feasible sets that provide the optimal greedy solution for a certain problem are described using the isotone property with respect to the canonical order. Some applications for the Knapsack problem are considered.

Functions, Polyhedral, Polyhedral functions

---

Similar abstracts:

• Abstracts: A practical heuristic for a large scale vehicle routing problem. Postoptimizing equilibrium flows on large scale networks
• Abstracts: Efficient solutions for the linear bilevel programming problem. Continuous optimization: suboptimality for multiobjective programming on Banach space
• Abstracts: The total perspective vortex. Dead again. Paying for big science
• Abstracts: The cash don't work. Twilight zone: the rouble
• Abstracts: Partisan politics: fissures widen in ruling coalition. Monarchs and men

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.