Semidefinite Relaxations of Ordering Problems

Mathematical Programming, Series B- Germany

doi 10.1007/s10107-012-0627-7

Full Text

Abstract

Available in

Date

Authors

Publisher

Springer Science and Business Media LLC

Related search

On Approximating Complex Quadratic Optimization Problems via Semidefinite Programming Relaxations

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005French

Semidefinite Programming Relaxations Through Quadratic Reformulation for Box-Constrained Polynomial Optimization Problems

2019English

A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for Some NP-Hard Graph Optimization Problems

INFOR
Signal ProcessingComputer Science ApplicationsInformation Systems
2015English

The Power of Semidefinite Programming Relaxations for MAX-SAT

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

Solving Commutative Relaxations of Word Problems

2007English

Multiobjective Duality for Convex Semidefinite Programming Problems

Zeitschrift fur Analysis und ihre Anwendung
Applied MathematicsAnalysis
2003English

Analysis of LP Relaxations for Multiway and Multicut Problems

Networks
Information SystemsComputer NetworksHardwareCommunicationsArchitectureSoftware
1999English

A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations

English

Convex Relaxations and Approximations of Chance-Constrained AC-OPF Problems

IEEE Transactions on Power Systems
Electronic EngineeringPower TechnologyElectricalEnergy Engineering
2019English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy