Pages that link to "Item:Q1290621"
From MaRDI portal
The following pages link to Solving quadratic (0,1)-problems by semidefinite programs and cutting planes (Q1290621):
Displaying 50 items.
- Probabilistic GRASP-tabu search algorithms for the UBQP problem (Q336712) (← links)
- Generating cutting planes for the semidefinite relaxation of quadratic programs (Q337405) (← links)
- Stochastic nuclear outages semidefinite relaxations (Q373211) (← links)
- Manifold relaxations for integer programming (Q380594) (← links)
- The unconstrained binary quadratic programming problem: a survey (Q405668) (← links)
- An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach (Q427399) (← links)
- Two-stage quadratic integer programs with stochastic right-hand sides (Q431020) (← links)
- Solving unconstrained binary quadratic programming problem by global equilibrium search (Q464982) (← links)
- Continuous representations and functional extensions in combinatorial optimization (Q508577) (← links)
- Quadratic reformulations of nonlinear binary optimization problems (Q517297) (← links)
- An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs (Q604951) (← links)
- Knapsack problem with probability constraints (Q628737) (← links)
- A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem (Q646707) (← links)
- Extending the QCR method to general mixed-integer programs (Q662304) (← links)
- A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs (Q683935) (← links)
- Convex relaxations for mixed integer predictive control (Q710707) (← links)
- An unconstrained quadratic binary programming approach to the vertex coloring problem (Q817187) (← links)
- ``Miniaturized'' linearizations for quadratic 0/1 problems (Q817208) (← links)
- A strong conic quadratic reformulation for machine-job assignment with controllable processing times (Q833574) (← links)
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations (Q847837) (← links)
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem (Q868442) (← links)
- Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method (Q946351) (← links)
- Predictive control for hybrid systems. Implications of polyhedral pre-computations (Q1003540) (← links)
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method (Q1025986) (← links)
- A linearization framework for unconstrained quadratic (0-1) problems (Q1025991) (← links)
- A note on representations of linear inequalities in non-convex mixed-integer quadratic programs (Q1728372) (← links)
- Reoptimization in Lagrangian methods for the \(0\)-\(1\) quadratic knapsack problem (Q1761937) (← links)
- Efficient semidefinite branch-and-cut for MAP-MRF inference (Q1800052) (← links)
- Parametric Lagrangian dual for the binary quadratic programming problem (Q2018469) (← links)
- On the impact of running intersection inequalities for globally solving polynomial optimization problems (Q2195679) (← links)
- Certifiably optimal sparse inverse covariance estimation (Q2205987) (← links)
- \texttt{MADAM}: a parallel exact solver for max-cut based on semidefinite programming and ADMM (Q2231040) (← links)
- Global optimality conditions for quadratic \(0-1\) optimization problems (Q2269587) (← links)
- Improving the linear relaxation of maximum \(k\)-cut with semidefinite-based constraints (Q2287849) (← links)
- Closed-form formulas for evaluating \(r\)-flip moves to the unconstrained binary quadratic programming problem (Q2333129) (← links)
- A new separation algorithm for the Boolean quadric and cut polytopes (Q2339832) (← links)
- Cutting planes for RLT relaxations of mixed 0-1 polynomial programs (Q2349139) (← links)
- A simplified binary artificial fish swarm algorithm for 0-1 quadratic knapsack problems (Q2349685) (← links)
- On characterization of maximal independent sets via quadratic optimization (Q2359154) (← links)
- Building an iterative heuristic solver for a quantum annealer (Q2374373) (← 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)
- A note on the 2-circulant inequalities for the MAX-cut problem (Q2417185) (← links)
- Improved semidefinite bounding procedure for solving max-cut problems to optimality (Q2436651) (← links)
- A compact variant of the QCR method for quadratically constrained quadratic \(0-1\) programs (Q2448194) (← links)
- A semidefinite programming heuristic for quadratic programming problems with complementarity constraints (Q2487469) (← links)
- A semidefinite programming based polyhedral cut and price approach for the maxcut problem (Q2506169) (← links)
- Cuts for mixed 0-1 conic programming (Q2571004) (← links)
- Spectral bundle methods for non-convex maximum eigenvalue functions: first-order methods (Q2576741) (← links)
- Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition (Q2583135) (← links)
