Infeasible/feasible search trajectories and directional rounding in integer programming

Journal of Heuristics

Volumn 13, Issue 6, 2007, Pages 505-541

  Glover, Fred ^a  

^a UNIVERSITY OF COLORADO   (United States)

Author keywords

Adaptive memory; Feasibility; Integer programming; Search trajectories

Indexed keywords

ADAPTIVE ALGORITHMS; COMBINATORIAL OPTIMIZATION; INTEGER PROGRAMMING; PROBLEM SOLVING;

ADAPTIVE MEMORY; DIRECTIONAL ROUNDING; FEASIBILITY; SEARCH TRAJECTORIES;

COMPUTATIONAL METHODS;

EID: 36048978990     PISSN: 13811231     EISSN: 15729397     Source Type: Journal    
DOI: 10.1007/s10732-007-9029-z     Document Type: Article

References (15)

1. Eckstein, J., Nediak, M.: Pivot, cut, and dive: a heuristic for mixed 0-1 integer programming. RUTCOR Research report RRR53-2001 (2001)
2. Fischetti, M., Glover, F., Lodi, A., Monaci, M.: Feasibility net. (2006, in preparation)
3. Gendreau, M.: On the importance of allowing infeasible moves in tabu search heuristics. In: INFORMS National Meeting, Denver, 24-27 October 2004
4. Glover, F.: Heuristics for integer programming using surrogate constraints. Decis. Sci. 8(1), 156-166 (1977)
5. Glover, F.: Parametric branch and bound. Int. J. Manag. Sci. 6, 1-9 (1978)
6. Glover, F.: Tabu search for nonlinear and parametric optimization (with links to genetic algorithms). Discrete Appl. Math. 49, 231-255 (1994)
7. Glover, F.: Scatter search and star-paths: beyond the genetic metaphor. OR Spectr. 17, 125-137 (1995)
8. Glover, F.: Adaptive memory projection methods for integer programming. In: Rego, C., Alidaee, B. (eds.) Metaheuristic Optimization via Memory and Evolution, pp. 425-440. Kluwer Academic, Dordrecht (2005)
9. Glover, F.: Parametric tabu search for mixed integer programs. Comput. Oper. Res. 33(9), 2449-2494 (2006)
10. Glover, F., Laguna, M.: Tabu search. In: Reeves, C. (ed.) Modern Heuristic Techniques for Combinatorial Problems, pp. 71-140. Blackwell Scientific, Oxford (1993)
11. Glover, F., Laguna, M.: Tabu Search. Kluwer Academic, Dordrecht (1997)
12. Guignard, M., Spielberg, K.: Double contraction, double probing, short starts and BB-probing cuts for mixed (0,1) programming. Wharton School report (2003)
13. Lokketangen, A., Glover, F.: Tabu search for zero-one mixed integer programming with advanced level strategies and learning. Int. J. Oper. Quant. Manag. 1(2), 89-108 (1995)
14. Lokketangen, A., Woodruff, D.L., Glover, F.: Scatter search to generate diverse MIP solutions. In: M. Laguna, J.L. Gonzalez-Velarde (eds.) OR Computing Tools for Modeling, Optimization and Simulation: Interfaces in Computer Science and Operations Research, pp. 299-317 (2000)
15. Spielberg, K., Guignard, M.: A sequential (quasi) hot start method for BB (0,1) mixed integer programming. In: Mathematical Programming Symposium, Atlanta, 2000