An enumerative framework for a class of nonlinear integer programming problems

Article Abstract:

An enumerative framework is used to solve a class of integer problems. The framework for the branch and search algorithm uses eigenvalue surrogate and duality theory for computation methodology of upper bounds with heuristics for computing good lower bounds. Preliminary evaluations show that the framework performs well in a class of general integer restricted, linearly constrained, quadratic integer problems.

Research and Development in the Physical, Engineering, and Life Sciences, Statistics, Operations Research, Analysis, Integer programming, Statistics (Mathematics), Nonlinear programming

---

Error bounds for the approximative solution of restricted planar location problems

Article Abstract:

Research into the restricted planar location problem develops error bounds for its approximative solution. An analysis of the number of approximation steps need to achieve a particular error bound is presented.

Industrial locations, Industrial location

---

Algorithms for graph partitioning problems by means of eigenspace relaxations

Article Abstract:

Research is presented into algorithms for graph partitioning problems by means of eigenspace relaxations.

Very-large-scale integration, Very large scale integration

Similar abstracts:

• Abstracts: Random pseudo-polynomial algorithms for some combinatorial programming problems. Unbounded knapsack problem: Dynamic programming revisited
• Abstracts: An efficient transformation of the generalized vehicle routing problem. On a cutting plane heuristic for the stable roommates problem and its applications
• Abstracts: Lower-bounding procedures for the 2-dimensional cell suppression problem. A new relaxation method for the generalized minimum spanning tree problem

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