A Unified Approach to Mixed-Integer Optimization Problems With Logical Constraints (Q5158761): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: BiqMac / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: JuMP / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1907.02109 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q120689954 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strong conic quadratic reformulation for machine-job assignment with controllable processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for disjunctive programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on Modern Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning procedures for solving mixed-variables programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2825953 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Best subset selection via a modern optimization lens / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certifiably optimal sparse inverse covariance estimation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse regression: scalable algorithms and empirical performance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse high-dimensional regression: exact scalable algorithms and phase transitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational study of a family of mixed-integer quadratic programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Solution Approach for Portfolio Optimization Problems Under Stochastic and Integer Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex relaxations and MIQCQP reformulations for a class of cardinality-constrained portfolio selection problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometry of cuts and metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: JuMP: A Modeling Language for Mathematical Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An outer-approximation algorithm for a class of mixed-integer nonlinear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benders decomposition without separability: a computational study for capacitated facility location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving mixed integer nonlinear programs by outer approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: L’algebre de Boole et ses applications en recherche operationnelle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximated perspective relaxations: a project and lift approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perspective cuts for a class of convex 0-1 mixed integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Nonlinear Single-Unit Commitment Problems with Ramping Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: SDP diagonalizations and perspective cuts for a class of nonseparable MIQP / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Cardinality Constrained Portfolio Selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Benders decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Linear Integer Programming Formulations of Nonlinear Integer Problems / 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: Perspective reformulations of mixed integer nonlinear programs with indicator variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perspective Reformulation and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Uncapacitated Network Design Problem by a Lagrangean Heuristic and Branch-and-Bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the capacitated facility location problems with single sourcing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Cutting-Plane Method for Solving Convex Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4537750 / 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: Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4324980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical enhancements to the Magnanti-Wong method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse learning via Boolean relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized rounding: A technique for provably good algorithms and algorithmic proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed Integer Linear Programming Formulation Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scalable Algorithms for the Sparse Ridge Regression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving the Performance of MIQP Solvers for Quadratic Programs with Cardinality and Minimum Threshold Constraints: A Semidefinite Program Approach / rank
 
Normal rank

Latest revision as of 22:34, 26 July 2024

scientific article; zbMATH DE number 7414053
Language Label Description Also known as
English
A Unified Approach to Mixed-Integer Optimization Problems With Logical Constraints
scientific article; zbMATH DE number 7414053

    Statements

    A Unified Approach to Mixed-Integer Optimization Problems With Logical Constraints (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    26 October 2021
    0 references
    0 references
    0 references
    0 references
    0 references
    mixed-integer optimization
    0 references
    branch and cut
    0 references
    outer approximation
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references