Mixed integer programming with a class of nonlinear convex constraints
type: Item
instance of: scholarly article
title: Mixed integer programming with a class of nonlinear convex constraints
zbMATH Open document ID: 1387.90166
author: Alexander Vinel
author: Pavlo A. Krokhmal
published in: Discrete Optimization
publication date: 2018-05-24T00:00:00Z
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C22
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90C90
zbMATH DE Number: 6872128
zbMATH Keywords: mixed-integer nonlinear programming
zbMATH Keywords: measures of risk
zbMATH Keywords: quasi-arithmetic average
zbMATH Keywords: valid inequalities
zbMATH Keywords: conic programming
describes a project that uses: FilMINT
describes a project that uses: Bonmin
MaRDI profile type: Publication
full work available at URL: j.disopt.2016.07.002
OpenAlex ID: W2482044897
cites work: Certainty equivalent measures of risk
cites work: A Scenario Decomposition Algorithm for Stochastic Programming Problems with a Class of Downside Risk Measures
cites work: Q4692666
cites work: Q5812325
cites work: Auctions of Shares
cites work: “Lottery Equivalents”: Reduction of the Certainty Effect Problem in Utility Assessment
cites work: AN OLD‐NEW CONCEPT OF CONVEX RISK MEASURES: THE OPTIMIZED CERTAINTY EQUIVALENT
cites work: Higher moment coherent risk measures
cites work: A lifted linear programming branch-and-bound algorithm for mixed-integer conic quadratic programs
cites work: Branch and Bound Experiments in Convex Nonlinear Integer Programming
cites work: An improved branch and bound algorithm for mixed integer nonlinear programs
cites work: Integrating SQP and branch-and-bound for mixed integer nonlinear programming
cites work: An outer-approximation algorithm for a class of mixed-integer nonlinear programs
cites work: Solving mixed integer nonlinear programs by outer approximation
cites work: An algorithmic framework for convex mixed integer nonlinear programs
cites work: FilMINT: an outer approximation-based solver for convex mixed-integer nonlinear programs
cites work: On Polyhedral Approximations of the Second-Order Cone
cites work: Polyhedral approximations inp-order cone programming
cites work: Conic mixed-integer rounding cuts
cites work: Lifting for conic mixed-integer programming
cites work: A branch-and-cut method for 0-1 mixed convex programming
cites work: Cuts for mixed 0-1 conic programming
cites work: Lift-and-Project Cuts for Mixed Integer Convex Programs
cites work: Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs
cites work: The MILP Road to MIQCP
cites work: Computing deep facet-defining disjunctive cuts for mixed-integer programming
cites work: Split cuts and extended formulations for mixed integer conic quadratic programming
cites work: On valid inequalities for mixed integer \(p\)-order cone programming
cites work: Intersection Cuts—A New Type of Cutting Planes for Integer Programming
cites work: Intersection Cuts for Mixed Integer Conic Quadratic Sets
cites work: A Conic Representation of the Convex Hull of Disjunctive Sets and Conic Cuts for Integer Second Order Cone Optimization
cites work: Cutting-Planes for Optimization of Convex Functions over Nonconvex Sets
cites work: On minimal valid inequalities for mixed integer conic programs
cites work: Two-term disjunctions on the second-order cone
cites work: A derivative-coderivative inclusion in second-order nonsmooth analysis
cites work: Q4779970
DOI: 10.1016/J.DISOPT.2016.07.002
description: scientific article; zbMATH DE number 6872128