Pages that link to "Item:Q632679"
From MaRDI portal
The following pages link to An interior point cutting plane heuristic for mixed integer programming (Q632679):
Displaying 9 items.
- Improved branching disjunctions for branch-and-bound: an analytic center approach (Q319920) (← links)
- Recursive central rounding for mixed integer programs (Q336910) (← links)
- Using the analytic center in the feasibility pump (Q408384) (← links)
- Boosting the feasibility pump (Q495939) (← links)
- Fixing variables and generating classical cutting planes when using an interior point branch and cut method to solve integer programming problems (Q1278590) (← links)
- A trajectory-based method for mixed integer nonlinear programming problems (Q1704918) (← links)
- Solving pseudo-convex mixed integer optimization problems by cutting plane techniques (Q1863894) (← links)
- Scanning integer points with lex-inequalities: a finite cutting plane algorithm for integer programming with linear objective (Q6057717) (← links)
- The Chebyshev center as an alternative to the analytic center in the feasibility pump (Q6081593) (← links)