An interior point cutting plane heuristic for mixed integer programming
From MaRDI portal
Publication:632679
Recommendations
- A cutting plane theory for mixed integer optimization
- The mixed cutting plane algorithm for all-integer programming
- Cutting planes in integer and mixed integer programming
- Solving pseudo-convex mixed integer optimization problems by cutting plane techniques
- Cutting plane algorithms for the inverse mixed integer linear programming problem
- The integration of an interior-point cutting plane method within a branch-and-price algorithm
- An interior-point Benders based branch-and-cut algorithm for mixed integer programs
- An optimality cut for mixed integer linear programs
- A disjunctive cutting plane procedure for general mixed-integer linear programs
- Intersection Cuts—A New Type of Cutting Planes for Integer Programming
Cites work
- scientific article; zbMATH DE number 4041641 (Why is no real title available?)
- scientific article; zbMATH DE number 1131479 (Why is no real title available?)
- A Heuristic Ceiling Point Algorithm for General Integer Linear Programming
- A feasibility pump heuristic for general mixed-integer problems
- Computational Experience with an Interior Point Cutting Plane Algorithm
- Decomposition and Nondifferentiable Optimization with the Projective Algorithm
- Efficient Heuristic Procedures for Integer Linear Programming with an Interior
- Experimental results on Hillier's linear search
- General purpose heuristics for integer programming. I
- General purpose heuristics for integer programming. II
- Improving the feasibility pump
- Noncommercial software for mixed-integer linear programming
- Octane: A New Heuristic for Pure 0–1 Programs
- On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm
- Partitioning procedures for solving mixed-variables programming problems
- Pivot and Complement–A Heuristic for 0-1 Programming
- Pivot and shift -- a mixed integer programming heuristic
- Solving combinatorial optimization problems using Karmarkar's algorithm
- Solving nonlinear multicommodity flow problems by the analytic center cutting plane method
- Solving zero-one mixed integer programming problems using tabu search
- The feasibility pump
- The integration of an interior-point cutting plane method within a branch-and-price 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
Cited in
(10)- Fixing variables and generating classical cutting planes when using an interior point branch and cut method to solve integer programming problems
- Boosting the feasibility pump
- Scanning integer points with lex-inequalities: a finite cutting plane algorithm for integer programming with linear objective
- Improved branching disjunctions for branch-and-bound: an analytic center approach
- The Chebyshev center as an alternative to the analytic center in the feasibility pump
- Solving pseudo-convex mixed integer optimization problems by cutting plane techniques
- Recursive central rounding for mixed integer programs
- Generating feasible points for mixed-integer convex optimization problems by inner parallel cuts
- A trajectory-based method for mixed integer nonlinear programming problems
- Using the analytic center in the feasibility pump
This page was built for publication: An interior point cutting plane heuristic for mixed integer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q632679)
