An interior point cutting plane heuristic for mixed integer programming

DOI10.1016/j.cor.2010.12.008zbMath1208.90121OpenAlexW2046798010MaRDI QIDQ632679

Joe Naoum-Sawaya, Samir Elhedhli

Publication date: 25 March 2011

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2010.12.008

zbMATH Keywords

interior point methodsanalytic centerfeasibilitymixed integer problemsACCPM

Mathematics Subject Classification ID

Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Interior-point methods (90C51)

Related Items (6)

Improved branching disjunctions for branch-and-bound: an analytic center approach ⋮ Recursive central rounding for mixed integer programs ⋮ The Chebyshev center as an alternative to the analytic center in the feasibility pump ⋮ Using the analytic center in the feasibility pump ⋮ A trajectory-based method for mixed integer nonlinear programming problems ⋮ Boosting the feasibility pump

Uses Software

• MIPLIB
• FEASPUMP
• MIPLIB2003
• NEOS
• Octane

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm
• Partitioning procedures for solving mixed-variables programming problems
• Solving combinatorial optimization problems using Karmarkar's algorithm
• Using an interior point method for the master problem in a decomposition approach
• Warm start of the primal-dual method applied in the cutting-plane scheme
• Solving nonlinear multicommodity flow problems by the analytic center cutting plane method
• General purpose heuristics for integer programming. I
• General purpose heuristics for integer programming. II
• Solving zero-one mixed integer programming problems using tabu search
• The integration of an interior-point cutting plane method within a branch-and-price algorithm
• Pivot and shift -- a mixed integer programming heuristic
• A feasibility pump heuristic for general mixed-integer problems
• Improving the feasibility pump
• The feasibility pump
• Octane: A New Heuristic for Pure 0–1 Programs
• Pivot and Complement–A Heuristic for 0-1 Programming
• A Heuristic Ceiling Point Algorithm for General Integer Linear Programming
• Decomposition and Nondifferentiable Optimization with the Projective Algorithm
• Experimental results on Hillier's linear search
• Computational Experience with an Interior Point Cutting Plane Algorithm
• Efficient Heuristic Procedures for Integer Linear Programming with an Interior

This page was built for publication: An interior point cutting plane heuristic for mixed integer programming