23,439 research outputs found
A Computational Comparison of Optimization Methods for the Golomb Ruler Problem
The Golomb ruler problem is defined as follows: Given a positive integer n,
locate n marks on a ruler such that the distance between any two distinct pair
of marks are different from each other and the total length of the ruler is
minimized. The Golomb ruler problem has applications in information theory,
astronomy and communications, and it can be seen as a challenge for
combinatorial optimization algorithms. Although constructing high quality
rulers is well-studied, proving optimality is a far more challenging task. In
this paper, we provide a computational comparison of different optimization
paradigms, each using a different model (linear integer, constraint programming
and quadratic integer) to certify that a given Golomb ruler is optimal. We
propose several enhancements to improve the computational performance of each
method by exploring bound tightening, valid inequalities, cutting planes and
branching strategies. We conclude that a certain quadratic integer programming
model solved through a Benders decomposition and strengthened by two types of
valid inequalities performs the best in terms of solution time for small-sized
Golomb ruler problem instances. On the other hand, a constraint programming
model improved by range reduction and a particular branching strategy could
have more potential to solve larger size instances due to its promising
parallelization features
Nonlinear Integer Programming
Research efforts of the past fifty years have led to a development of linear
integer programming as a mature discipline of mathematical optimization. Such a
level of maturity has not been reached when one considers nonlinear systems
subject to integrality requirements for the variables. This chapter is
dedicated to this topic.
The primary goal is a study of a simple version of general nonlinear integer
problems, where all constraints are still linear. Our focus is on the
computational complexity of the problem, which varies significantly with the
type of nonlinear objective function in combination with the underlying
combinatorial structure. Numerous boundary cases of complexity emerge, which
sometimes surprisingly lead even to polynomial time algorithms.
We also cover recent successful approaches for more general classes of
problems. Though no positive theoretical efficiency results are available, nor
are they likely to ever be available, these seem to be the currently most
successful and interesting approaches for solving practical problems.
It is our belief that the study of algorithms motivated by theoretical
considerations and those motivated by our desire to solve practical instances
should and do inform one another. So it is with this viewpoint that we present
the subject, and it is in this direction that we hope to spark further
research.Comment: 57 pages. To appear in: M. J\"unger, T. Liebling, D. Naddef, G.
Nemhauser, W. Pulleyblank, G. Reinelt, G. Rinaldi, and L. Wolsey (eds.), 50
Years of Integer Programming 1958--2008: The Early Years and State-of-the-Art
Surveys, Springer-Verlag, 2009, ISBN 354068274
A Decomposition Algorithm for Nested Resource Allocation Problems
We propose an exact polynomial algorithm for a resource allocation problem
with convex costs and constraints on partial sums of resource consumptions, in
the presence of either continuous or integer variables. No assumption of strict
convexity or differentiability is needed. The method solves a hierarchy of
resource allocation subproblems, whose solutions are used to convert
constraints on sums of resources into bounds for separate variables at higher
levels. The resulting time complexity for the integer problem is , and the complexity of obtaining an -approximate
solution for the continuous case is , being
the number of variables, the number of ascending constraints (such that ), a desired precision, and the total resource. This
algorithm attains the best-known complexity when , and improves it when
. Extensive experimental analyses are conducted with four
recent algorithms on various continuous problems issued from theory and
practice. The proposed method achieves a higher performance than previous
algorithms, addressing all problems with up to one million variables in less
than one minute on a modern computer.Comment: Working Paper -- MIT, 23 page
On the complexity of nonlinear mixed-integer optimization
This is a survey on the computational complexity of nonlinear mixed-integer
optimization. It highlights a selection of important topics, ranging from
incomputability results that arise from number theory and logic, to recently
obtained fully polynomial time approximation schemes in fixed dimension, and to
strongly polynomial-time algorithms for special cases.Comment: 26 pages, 5 figures; to appear in: Mixed-Integer Nonlinear
Optimization, IMA Volumes, Springer-Verla
- …