Pages that link to "Item:Q2885494"
From MaRDI portal
The following pages link to On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems (Q2885494):
Displaying 10 items.
- Single row layout models (Q319651) (← links)
- Fixing variables and generating classical cutting planes when using an interior point branch and cut method to solve integer programming problems (Q1278590) (← links)
- Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem (Q2391873) (← links)
- LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison (Q2392866) (← links)
- Conic approximation to quadratic optimization with linear complementarity constraints (Q2397094) (← links)
- Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts (Q2802535) (← links)
- An improved interior-point cutting-plane method for binary quadratic optimization (Q2883644) (← links)
- SOME EXPERIENCES WITH SOLVING SEMIDEFINITE PROGRAMMING RELAXATIONS OF BINARY QUADRATIC OPTIMIZATION MODELS IN COMPUTATIONAL BIOLOGY (Q2931718) (← links)
- Construction heuristics for the single row layout problem with machine-spanning clearances (Q5884347) (← links)
- Solving quadratic semi-infinite programming problems by using relaxed cutting-plane scheme (Q5936072) (← links)
