Semidefinite relaxations for partitioning, assignment and ordering problems (Q5925162): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3429015 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook on semidefinite, conic and polynomial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A semidefinite optimization approach for the single-row layout problem with unequal dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3425132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets of the Bipartite Subgraph Polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experiments in quadratic 0-1 programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the cut polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite relaxations for partitioning, assignment and ordering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Algorithms for the Quadratic Linear Ordering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assignment Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An SDP Approach to Multi-level Crossing Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Aspects of semidefinite programming. Interior point algorithms and selected applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On approximate graph colouring and MAX-\(k\)-CUT algorithms based on the \(\vartheta\)-function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Laplacian eigenvalues and the maximum cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The cut polytope and the Boolean quadric polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hypermetric cone is polyhedral / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3236244 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526964 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixing Variables in Semidefinite Relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving quadratic (0,1)-problems by semidefinite programs and cutting planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite representation of convex sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite relaxations of ordering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for maximum graph partitioning problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4400639 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3983251 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Heuristic Procedure for Partitioning Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3395491 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5292090 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed integer nonlinear programming. Selected papers based on the presentations at the IMA workshop mixed-integer nonlinear optimization: Algorithmic advances and applications, Minneapolis, MN, USA, November 17--21, 2008 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Shannon capacity of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4407449 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cones of Matrices and Set-Functions and 0–1 Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving \(k\)-cluster problems to optimality with semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The linear ordering problem. Exact and heuristic methods in combinatorial optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Newton-CG Augmented Lagrangian Method for Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4324980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Boolean quadratic polytope: Some characteristics, facets and relatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational aspects of a branch and bound algorithm for quadratic zero- one programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite Relaxations for Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for the quadratic assignment problem using the bundle method / rank
 
Normal rank
Property / cites work
 
Property / cites work: From linear to semidefinite programming: an algorithm to obtain semidefinite relaxations for bivalent quadratic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral and semidefinite programming methods in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of semidefinite programming. Theory, algorithms, and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming relaxations for the quadratic assignment problem / rank
 
Normal rank

Latest revision as of 08:40, 12 July 2024

scientific article; zbMATH DE number 6605536
Language Label Description Also known as
English
Semidefinite relaxations for partitioning, assignment and ordering problems
scientific article; zbMATH DE number 6605536

    Statements

    Semidefinite relaxations for partitioning, assignment and ordering problems (English)
    0 references
    22 July 2016
    0 references
    0 references
    semidefinite optimization
    0 references
    partitioning problem
    0 references
    ordering problem
    0 references
    assignment problem
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references