Potential reduction algorithms for structured combinatorial optimization problems

Authors:
J. P. Warners;T. Terlaky;C. Roos;B. Jansen
Affiliations:
Department of Statistics, Probability and Operations Research, Faculty of Technical Mathematics and Informatics, Delft University of Technology, P.O. Box 5031, 2600 GA Delft, The Netherlands;Department of Statistics, Probability and Operations Research, Faculty of Technical Mathematics and Informatics, Delft University of Technology, P.O. Box 5031, 2600 GA Delft, The Netherlands;Department of Statistics, Probability and Operations Research, Faculty of Technical Mathematics and Informatics, Delft University of Technology, P.O. Box 5031, 2600 GA Delft, The Netherlands;CQM B.V., P.O. Box 414, 5600 AK, Eindhoven, The Netherlands
Venue:
Operations Research Letters
Year:
1997

Citing 3
Cited 1

Direct methods for sparse matrices

Direct methods for sparse matrices
Computational experience with an interior point algorithm on the satisfiability problem

Annals of Operations Research
An interior point algorithm to solve computationally difficult set covering problems

Mathematical Programming: Series A and B - Special issue on interior point methods for linear programming: theory and practice

From support vector machine learning to the determination of the minimum enclosing zone

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recently Karmarkar proposed a potential reduction algorithm for binary feasibility problems. In this paper, a modified potential function that has more attractive properties is introduced. Furthermore, as the main result, for a specific class of binary feasibility problems a concise reformulation as nonconvex quadratic optimization problems is developed. We introduce a potential function to optimize the new model and report on computational experience with the graph coloring problem, comparing the performance of the three potential functions.