Cuts for mixed 0-1 conic programming (Q2571004): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Second-order cone programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the solution of traveling salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjunctive Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lift-and-project cutting plane algorithm for mixed 0-1 programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the cut polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4496020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving problems with semidefinite and related constraints using interior-point methods for nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Matrix Inequalities in System and Control Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4537748 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4263707 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Solutions to Uncertain Semidefinite Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4517107 / 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: Robust Portfolio Selection Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5465120 / 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: How Good is the Goemans--Williamson MAX CUT Algorithm? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Optimization with Polynomials and the Problem of Moments / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3677509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Portfolio optimization with linear and fixed transaction costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of second-order cone programming / 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: Fixing variables and generating classical cutting planes when using an interior point branch and cut method to solve integer programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Experience with an Interior Point Cutting Plane Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4496022 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restarting after branching in the SDP approach to MAX-CUT and similar combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4324980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSPLIB—A Traveling Salesman Problem Library / 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: A branch-and-cut method for 0-1 mixed convex programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating convex polynomial inequalities for mixed 0-1 programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite Programming / rank
 
Normal rank

Latest revision as of 08:59, 11 June 2024

scientific article
Language Label Description Also known as
English
Cuts for mixed 0-1 conic programming
scientific article

    Statements

    Cuts for mixed 0-1 conic programming (English)
    0 references
    0 references
    31 October 2005
    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