Semidefinite Programming and Constraint Programming (Q2802541): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: OPL / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: XPRESS / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-1-4614-0769-0_22 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W164225028 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved semidefinite programming relaxation for the satisfiability problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Globally Optimal Solutions for Single-Row Layout Problems Using Semidefinite Programming and Cutting Planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The essence of constraint propagation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principles of Constraint Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-optimal algorithms for maximum constraint satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687265 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Biclique completion problems for multicast network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local branching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization-oriented global constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding relaxations in global constraints for solving TSP and TSPTW / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Hybrid Exact Algorithm for the TSPTW / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving TSP through the Integration of OR and CP Techniques / 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: New $\frac{3}{4}$-Approximation Algorithms for the Maximum Satisfiability 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: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Experience with Stable Set Relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: k-Clustering Minimum Biclique Completion via a Hybrid CP and SDP Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint Satisfaction over a Non-Boolean Domain: Approximation Algorithms and Unique-Games Hardness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixing Variables in Semidefinite Relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4523706 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrated methods for optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4375770 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On semidefinite programming relaxations of \((2+p)\)-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4550772 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relaxations of the satisfiability problem using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach for weighted constraint satisfaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connection between semidefinite relaxations of the max-cut and stable set problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5292090 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principles and Practice of Constraint Programming – CP 2004 / 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: Symmetry in Integer Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint and integer programming. Toward a unified methodology. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549708 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrality Gaps for Strong SDP Relaxations of UNIQUE GAMES / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Round Any CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4473038 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cost-based arc consistency for global cardinality constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3184605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principles and Practice of Constraint Programming – CP 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cost-based filtering for shorter path constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Search and strategies in OPL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principles and Practice of Constraint Programming – CP 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploiting semidefinite relaxations in constraint programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On global warming: Flow-based soft global constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258616 / rank
 
Normal rank
Property / cites work
 
Property / cites work: MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250183 / rank
 
Normal rank

Latest revision as of 21:33, 11 July 2024

scientific article
Language Label Description Also known as
English
Semidefinite Programming and Constraint Programming
scientific article

    Statements

    Semidefinite Programming and Constraint Programming (English)
    0 references
    26 April 2016
    0 references
    constraint programming
    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
    0 references

    Identifiers