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

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10107-005-0578-3
+Normal rank
@@ Property / OpenAlex ID @@
+W1964191135
@@ Property / OpenAlex ID: W1964191135 / rank @@
+Normal rank
@@ Property / cites work @@
+Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
+Normal rank
@@ Property / cites work @@
+Second-order cone programming
@@ Property / cites work: Second-order cone programming / rank @@
+Normal rank
@@ Property / cites work @@
+Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem
+Normal rank
@@ Property / cites work @@
+On the solution of traveling salesman problems
@@ Property / cites work: On the solution of traveling salesman problems / rank @@
+Normal rank
@@ Property / cites work @@
+Disjunctive Programming
@@ Property / cites work: Disjunctive Programming / rank @@
+Normal rank
@@ Property / cites work @@
+A lift-and-project cutting plane algorithm for mixed 0-1 programs
+Normal rank
@@ Property / cites work @@
+On the cut polytope
@@ Property / cites work: On the cut polytope / rank @@
+Normal rank
@@ Property / cites work @@
+Q4496020
@@ Property / cites work: Q4496020 / rank @@
+Normal rank
@@ Property / cites work @@
+Robust Convex Optimization
@@ Property / cites work: Robust Convex Optimization / rank @@
+Normal rank
@@ Property / cites work @@
+Solving problems with semidefinite and related constraints using interior-point methods for nonlinear programming
+Normal rank
@@ Property / cites work @@
+Linear Matrix Inequalities in System and Control Theory
+Normal rank
@@ Property / cites work @@
+Q4537748
@@ Property / cites work: Q4537748 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4263707
@@ Property / cites work: Q4263707 / rank @@
+Normal rank
@@ Property / cites work @@
+Robust Solutions to Uncertain Semidefinite Programs
+Normal rank
@@ Property / cites work @@
+Semidefinite programming in combinatorial optimization
+Normal rank
@@ Property / cites work @@
+Q4517107
@@ Property / cites work: Q4517107 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
+Normal rank
@@ Property / cites work @@
+Robust Portfolio Selection Problems
@@ Property / cites work: Robust Portfolio Selection Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q5465120
@@ Property / cites work: Q5465120 / rank @@
+Normal rank
@@ Property / cites work @@
+Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
+Normal rank
@@ Property / cites work @@
+How Good is the Goemans--Williamson MAX CUT Algorithm?
+Normal rank
@@ Property / cites work @@
+Global Optimization with Polynomials and the Problem of Moments
+Normal rank
@@ Property / cites work @@
+A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
+Normal rank
@@ Property / cites work @@
+Q3677509
@@ Property / cites work: Q3677509 / rank @@
+Normal rank
@@ Property / cites work @@
+Portfolio optimization with linear and fixed transaction costs
+Normal rank
@@ Property / cites work @@
+Applications of second-order cone programming
@@ Property / cites work: Applications of second-order cone programming / rank @@
+Normal rank
@@ Property / cites work @@
+Cones of Matrices and Set-Functions and 0–1 Optimization
+Normal rank
@@ Property / cites work @@
+Fixing variables and generating classical cutting planes when using an interior point branch and cut method to solve integer programming problems
+Normal rank
@@ Property / cites work @@
+Computational Experience with an Interior Point Cutting Plane Algorithm
+Normal rank
@@ Property / cites work @@
+Q4496022
@@ Property / cites work: Q4496022 / rank @@
+Normal rank
@@ Property / cites work @@
+Restarting after branching in the SDP approach to MAX-CUT and similar combinatorial optimization problems
+Normal rank
@@ Property / cites work @@
+Q4324980
@@ Property / cites work: Q4324980 / rank @@
+Normal rank
@@ Property / cites work @@
+TSPLIB—A Traveling Salesman Problem Library
@@ Property / cites work: TSPLIB—A Traveling Salesman Problem Library / rank @@
+Normal rank
@@ Property / cites work @@
+A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
+Normal rank
@@ Property / cites work @@
+A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
+Normal rank
@@ Property / cites work @@
+A branch-and-cut method for 0-1 mixed convex programming
+Normal rank
@@ Property / cites work @@
+Generating convex polynomial inequalities for mixed 0-1 programs
+Normal rank
@@ Property / cites work @@
+Semidefinite Programming
@@ Property / cites work: Semidefinite Programming / rank @@
+Normal rank