Pivot and shift - A mixed integer programming heuristic

Discrete Optimization

Volumn 1, Issue 1, 2004, Pages 3-12

  Balas, Egon ^a   Schmieta, Stefan ^b   Wallace, Christopher ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b Axioma Inc   (United States)

Author keywords

Heuristics; Local branching; Mixed integer programming; Neighborhood search; Pivot and complement

Indexed keywords

C (PROGRAMMING LANGUAGE); CONSTRAINT THEORY; FLOWCHARTING; FORTRAN (PROGRAMMING LANGUAGE); HEURISTIC PROGRAMMING; PARAMETER ESTIMATION; PROBLEM SOLVING; XML;

LOCAL BRANCHING; MIXED INTEGER PROGRAMMING (MIP); NEIGHBORHOOD SEARCH; PIVOT AND COMPLEMENT;

INTEGER PROGRAMMING;

EID: 13944265305     PISSN: 15725286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disopt.2004.03.001     Document Type: Article

References (7)

1. Balas E., Martin C.H. Pivot and complement - a heuristic for 0-1 programming. Management Sci. 26:1980;86-96
2. E. Balas, C.H. Martin, Pivot and Shift - A Heuristic for Mixed Integer Programming, GSIA, Carnegie Mellon University, August 1986.
3. Fischetti M., Lodi A. Local Branching. Math. Programming B. 98:2003;23-49
4. http://www.math.cmu.edu/~cwallace.
5. http://plato.asu.edu/bench.html.
6. MIPLIB 3.0: http://www.caam.rice.edu/~bixby/miplib/miplib.html.
7. ++ Implementation of Pivot and Shift, Axioma, 2000.