ABRAMSON, D., DANG, H., AND KRISHNAMOORTHY, M. A comparison of two methods for solving 0--1 integer programs using a general purpose simulated annealing algorithm. Annals of Operations Research 63 (1996), 129--150. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Domain-Independent Local Search For Linear Integer Optimization - Walser (1998) (8 citations) (Correct)
.... constraints and primarily operate on continuous variables [9, 3, 103, 59, 61] e.g. by solving the linear program followed by special pivot moves) and (ii) local search methods in which the local moves are performed directly in the space of integer solutions, such as simulated annealing [33, 4] and stochastic local search [146, 147] The methods presented in this thesis are of the second type and arise from generalizing successful strategies of local search for propositional satisfiability [146, 147] We will refer to these methods as integer local search. Local Search for ....
....is used to obtain the initial solution. 3.3. 3 Search Space Reduction using LP Reduced Costs We next describe a method for dynamic search space reduction of local search which can be employed in combination with WSAT(OIP) and which has been reported by Balas and Martin [9] and Abramson et al. [4]. The idea is that solving the LP relaxation of an integer program to optimality reveals information about the sensitivity of the solution with respect to changes in the problem s parameters. In mathematical programming, such analysis is referred to as sensitivity analysis [31, 149] An ....
[Article contains additional citation context not shown here]
ABRAMSON, D., DANG, H., AND KRISHNAMOORTHY, M. A comparison of two methods for solving 0--1 integer programs using a general purpose simulated annealing algorithm. Annals of Operations Research 63 (1996), 129--150.
A General Meta-Heuristic Based Solver for Combinatorial.. - Randall, Abramson (2000) (5 citations) Self-citation (Abramson) (Correct)
....0 1 ILP notation [53] however, meta heuristics nd it dicult to navigate the sparse 0 1 space of a COP. This is because changing a value of a variable can break many of the problem s constraints, and restoring these to a feasible state is a costly exercise (especially for practical size problems) [4] [6] We have found that there are two basic approaches to producing general purpose meta heuristic codes. The rst of which is characterised by GPSIMAN (General Purpose SIMulated ANnealing) 20] that solves 0 1 ILPs with SA. This approach is adequate for very small problems only, because of the ....
D. Abramson, H. Dang and M. Krishnamoorthy, \A Comparison of Two Methods for Solving 0-1 Integer Programs Using a General Purpose Simulated Annealing," Annals of Operations Research, vol. 63, pp. 129-150, 1996.
A Simulated Annealing code for General Integer Linear Programs - Abramson, Randall (1997) (3 citations) Self-citation (Abramson) (Correct)
....are given followed by some results. 2 General Simulated Annealing for 0 1 Problems It is possible to express many combinatorial optimisation problems in a form which uses binary integer variables. This approach has good expressive power, and has been used to represent a wide range of problems [1] [17] 18] 19] Over the years a number of different techniques have been developed for solving such systems. 2.1 Problem Formulation The general formulation for a 0 1 combinatorial optimisation problem is: Minimise=Maximise P N j=1 C j X j subject to: Ax 8 : 9 = B X j 2 f0; 1g ....
....methods. In this paper we explore the use of simulated annealing, for solving arbitrary integer problems. 2. 2 Solving Using Simulated Annealing Simulated Annealing (SA) is a general purpose meta heuristic method that has been applied successfully to a number of combinatorial optimisation problems [1] [6] 8] 14] 20] The theory of simulated annealing is derived from the physics of annealing substances. Simulated annealing seeks to minimise an energy function, which in combinatorial optimisation is the objective function. At the beginning of the annealing run there is a high likelihood of ....
[Article contains additional citation context not shown here]
D. Abramson, H. Dang and M. Krishnamoorthy, A Comparison of Two Methods for Solving 0-1 Integer Programs Using a General Purpose Simulated Annealing, Annals of Operations Research 63(1996) 129-150.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC