Conic mixed-integer rounding cuts (Q847842): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: FilMINT / 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/s10107-008-0239-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2106871914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: FilMINT: An Outer Approximation-Based Solver for Convex Mixed-Integer Nonlinear Programs / rank
 
Normal rank
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: Cuts for Conic Mixed-Integer Programming / 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: Lectures on Modern Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 875 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithmic framework for convex mixed integer nonlinear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: CSDP, A C library for semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cuts for mixed 0-1 conic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming in combinatorial optimization / 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: Integer Programming and Pricing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Second Order Cone Programming Relaxation of a Positive Semidefinite Constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4537750 / 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: On blind source separation using mutual information criterion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Aggregation and Mixed Integer Rounding to Solve MIPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Near-Maximum-Likelihood Decoding Algorithm for MIMO Systems Based on Semi-Definite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A recursive procedure to generate all cuts for 0-1 mixed integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3813613 / 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: Optimization with disjunctive constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A reformulation-convexification approach for solving nonconvex quadratic 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: Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization of mixed-integer nonlinear programs: a theoretical and computational study / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polyhedral branch-and-cut approach to global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: SDPT3 — A Matlab software package for semidefinite programming, Version 1.3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementation and evaluation of SDPA 6.0 (Semidefinite Programming Algorithm 6.0) / rank
 
Normal rank

Latest revision as of 11:05, 2 July 2024

scientific article
Language Label Description Also known as
English
Conic mixed-integer rounding cuts
scientific article

    Statements

    Conic mixed-integer rounding cuts (English)
    0 references
    0 references
    0 references
    19 February 2010
    0 references
    conic programming
    0 references
    branch-and-bound algorithms
    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