Adaptive Memory Projection Methods for Integer Programming

Glover, Fred

doi:10.1007/0-387-23667-8_19

Cited by 25 publications

(20 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The method may be used to project dual solutions onto the primal solution space or to achieve feasibility for infeasible solutions encountered in search paths originating from primal feasible solutions. A variety of possibilities exist to create projection methods that take advantage of adaptive memory-see Rego (2005) and Glover (2005) for examples of those options.…”

Section: The Ramp Method: Conceptual Foundations and Overviewmentioning

confidence: 99%

RAMP for the capacitated minimum spanning tree problem

2010

Self Cite

View full text Add to dashboard Cite

This paper introduces dual and primal-dual RAMP algorithms for the solution of the capacitated minimum spanning tree problem (CMST). A surrogate constraint relaxation incorporating cutting planes is proposed to explore the dual solution space. In the dual RAMP approach, primal-feasible solutions are obtained by simple tabu searches that project dual solutions onto primal feasible space. A primal-dual approach is achieved by including a scatter search procedure that further exploits the adaptive memory framework. Computational results from applying the methods to a standard set of benchmark problems disclose that the dual RAMP algorithm finds high quality solutions very efficiently and that its primal-dual enhancement is still more effective.

show abstract

Section: The Ramp Method: Conceptual Foundations and Overviewmentioning

confidence: 99%

RAMP for the capacitated minimum spanning tree problem

2010

Self Cite

View full text Add to dashboard Cite

show abstract

“…Such a strategy was also proposed in connection with exploiting strongly determined and consistent variables in Glover (1977), and has come to be one of the basic strategies associated with tabu search. (Discussions of this strategy in multiple contexts appear in Glover and Laguna (1997) and in Glover (2005). )…”

Section: Backbone-guided Tabu Search For Ubqpmentioning

confidence: 99%

Backbone guided tabu search for solving the UBQP problem

Wang

Glover

et al. 2011

J Heuristics

Self Cite

View full text Add to dashboard Cite

We propose a backbone-guided tabu search (BGTS) algorithm for the Unconstrained Binary Quadratic Programming (UBQP) problem that alternates between two phases: (1) a basic tabu search procedure to optimize the objective function as far as possible; (2) a strategy using the TS notion of strongly determined variables to alternately fix and free backbone components of the solutions which are estimated likely to share values in common with an optimal solution. Experimental results show that the proposed method is capable of finding the best-known solutions for 21 large random instances with 3000 to 7000 variables and boosts the performance of the basic TS in terms of both solution quality and computational efficiency.

show abstract

“…Glover (2005) proposed a general iterative method for pure and mixed integer programming. This method, which is referred to as the Adaptive Memory Projection (AMP), consists of four steps:…”

Section: An Iterative Schemementioning

confidence: 99%