Data dependent worst case bounds for weighted set packing

Article Abstract:

Three algorithms that use data for evolving optimal weighted set packing solutions are presented. The usage of integer programming, heuristics, and linear programming duality for the purpose, is discussed. The resultant solution indicates the worst-case bounds for weighted set packing.

Canada, Linear programming, Measurement, Heuristic, Mathematical optimization, Optimization theory, Heuristics (Psychology)

---

Parametric on-line algorithms for packing rectangles and boxes

Article Abstract:

Approximation algorithms for the two-dimensional bin packing (2BP), the three-dimensional packing problem (TPP) and the container packing problem (3BP) are discussed. A special case in which the items are to be packed on-line and are small is considered.

Analysis, Approximation theory, Approximation

---

Improved local search algorithms for the rectangle packing problem with general spatial costs

Article Abstract:

An algorithm that generates optimal sequencing that is useful to resolve the rectangle packing problems with spatial costs is presented. The dynamic programming in the algorithm is also useful in resolving scheduling problems.

Japan, Scheduling (Management), Sequential analysis, Spatial analysis (Statistics)

Similar abstracts:

• Abstracts: Enhancing an algorithm for set covering problems. A tree search algorithm for the crew scheduling problem. A heuristic for Euclidean and rectilinear Steiner problems
• Abstracts: Experiments with dynamic programming algorithms for nonseparable problems. A heuristic for finding embedded network structure in mathematical programmes
• Abstracts: A procedure for the one-machine sequencing problem with dependent jobs. Genetic algorithms to minimize the weighted number of late jobs on a single machine
• Abstracts: On the computational efficiency of multiple objective metaheuristics. The knapsack problem case study. Genetic local search with distance preserving recombination operator for a vehicle routing problem
• Abstracts: A partial view of OR in Switzerland. Constructing a course schedule by solving a series of assignment type problems

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