DINS, a MIP improvement heuristic

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4513 LNCS, Issue , 2007, Pages 310-323

  Ghosh, Shubhashis ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; LINEAR PROGRAMMING; ONLINE SEARCHING; PROBLEM SOLVING;

LINEAR PROGRAMMING RELAXATION OPTIMAL SOLUTIONS; LOCAL BRANCHING; RELAXATION INDUCED NEIGHBOURHOOD SEARCH; STANDARD BENCHMARK PROBLEMS;

HEURISTIC METHODS;

EID: 38049038830     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72792-7_24     Document Type: Conference Paper

References (18)

1. E. Balas, S. Ceria, M. Dawande, F. Margot, and G. Pataki. Octane: a new heuristic for pure 0-1 programs. Operations Research, 49(2):207-225, 2001.
2. E. Balas and C.H. Martin. Pivot and complement - a heuristic for 0-1 programming. Management Science, 26(1):86-96, 1980.
3. E. Balas and C.H. Martin. Pivot and shift - a heuristic for mixed integer programming. Technical report, GSIA, Carnegie Mellon University, 1986.
4. E. Balas, S. Schmieta, and C. Wallace. Pivot and shift - a mixed integer programming heuristic. Discrete Optimization, 1:3-12, 2004.
5. E. Danna, E. Rothberg, and C.L. Pape. Exploring relaxation induced neighborhhods to improve mip solutions. Mathematical Programming, 102:71-90, 2005.
6. DEIS. Library of instances. www.or.deis.unibo.it/research_pa ges/ORinstances/.
7. B.H. Faaland and F.S. Hillier. Interior path methods for heuristic integer programming procedures. Operations Research, 27(6): 1069-1087, 1979.
8. M. Fischetti, F. Glover, and A. Lodi. The feasibilty pump, to be appeared on Mathematical Programming.
9. M. Fischetti and A. Lodi. Local branching. Mathematical Programming B, 98: 23-49, 2003.
10. S. Ghosh. Description of all the used benchmark instances in this paper. www.cs.ualberta.ca/~shubhash/dins/benchmarks.ps.
11. S. Ghosh. Implementation of DINS. www.cs.ualberta.ca/~shubhash/codes. html.
12. F.S. Hillier. Efficient heuristic procedures for integer linear programming with an interior. Operations Research, 17(4):600-637, 1969.
13. T. Ibaraki, T. Ohashi, and H. Mine. A heuristic algorithm for mixed-integer programming problems. Math. Program. Study., 2:115-136, 1974.
14. R. M. Karp. Reducibility among combinatorial problems. In R. E. Miller and J. W. Thatcher, editors, Complexity of Computer Computations, pages 85-103. Plenum Press, New York, 1972.
15. A. Løkketangen, K. Jörnsten, and S. Storøy. Tabu search within a pivot and complement framework. International Transactions in Operational Research, 1(3): 305-317, 1994.
16. A. Løkketangen and D.L. Woodruff. Integrating pivot based search with branch and bound for binary mip's. Control and Cybernetics, Special issue on Tabu Search, 29(3):741-760, 2001.
17. A. Martin, T. Achterberg, and T. Koch. Miplib 2003. http://miplib.zib.de.
18. M. Nediak and J. Eckstein. Pivot, cut, and dive: A heuristic for mixed 0-1 integer programming. RUTCOR Research Report, RRR 53-2001, 2001.