LP relaxation of the two dimensional knapsack problem with box and GUB constraints

Article Abstract:

A new procedure for carrying out the linear programming relaxation of the knapsack problem with box and generalized upper bound constraints is discussed. The two-dimensional problem, which arose out of a production control problem in a steel tube rolling mill in India, is a generalized variant of the multiple choice linear knapsack problem. The algorithm has a worst case complexity of O(n2 log n).

Operations research, Methods, Management science, Linear programming, Case studies

---

Neighborhood search heuristics for the uncapacitated facility location problem

Article Abstract:

Neighborhood search heuristics based on tabu search (TS) and complete local search (CLS) with memory are used to solve large instances of the uncapacitated facility location problem. The conclusion states that on large sized instances, the heuristics generate low cost solutions quite fast, and terminate with solutions whose costs are within 0.0345 percent of each other.

Analysis, Search theory

---

Sensitivity analysis of a greedy heuristic for knapsack problems

Article Abstract:

A study examines heuristic for knapsack problems using parametric analysis and sensitivity analysis.

Singapore, Usage

Similar abstracts:

• Abstracts: Approximation algorithms for the oriented two-dimensional bin packing problem. A note on exact algorithms for the identical parallel machine scheduling problem
• Abstracts: A hierarchical approach for one-dimensional cutting stock problems in the steel industry that maximizes yield and minimizes overgrading
• Abstracts: A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls. A unified heuristic for a large class of Vehicle Routing Problems with Backhauls
• Abstracts: Solving Irregular Strip Packing problems by hybridising simulated annealing and linear programming. Routing and wavelength assignment by partition colouring
• Abstracts: Solving Irregular Strip Packing problems by hybridising simulated annealing and linear programming. part 2 Using simulated annealing to optimize the feature selection problem in marketing applications

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