Projected Perspective Reformulations with Applications in Design Problems
From MaRDI portal
Publication:2879518
DOI10.1287/opre.1110.0930zbMath1235.90148OpenAlexW2080249702WikidataQ118165466 ScholiaQ118165466MaRDI QIDQ2879518
Enrico Grande, Claudio Gentile, Andrea Pacifici, Antonio Frangioni
Publication date: 26 March 2012
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.1110.0930
network design problemsemicontinuous variablesmixed-integer nonlinear programming problemsperspective relaxationsensor placement problem
Related Items
On the Convexification of Constrained Quadratic Optimization Problems with Indicator Variables, Minimum cost paths over dynamic networks, Delay-constrained routing problems: accurate scheduling models and admission control, Perspective Reformulations of the CTA Problem with L2 Distances, Tighter quadratically constrained convex reformulations for semi-continuous quadratic programming, Recent advances in mathematical programming with semi-continuous variables and cardinality constraint, A computationally useful algebraic representation of nonlinear disjunctive convex sets using the perspective function, The equivalence of optimal perspective formulation and Shor's SDP for quadratic programs with indicator variables, Quadratic Convex Reformulations for Semicontinuous Quadratic Programming, A computational study of perspective cuts, Extended formulations in mixed integer conic quadratic programming, Deep Neural Networks Pruning via the Structured Perspective Regularization, A polynomial-time algorithm with tight error bounds for single-period unit commitment problem, A fast global algorithm for singly linearly constrained separable binary quadratic program with partially identical parameters, Improving the approximated projected perspective reformulation by dual information, A conic quadratic formulation for a class of convex congestion functions in network flow problems, QPLIB: a library of quadratic programming instances, Strengthening the sequential convex MINLP technique by perspective reformulations, Perspective Reformulations of Semicontinuous Quadratically Constrained Quadratic Programs, Outlier Detection in Time Series via Mixed-Integer Conic Quadratic Optimization, Delay-constrained shortest paths: approximation algorithms and second-order cone models, A library for continuous convex separable quadratic knapsack problems, Ideal formulations for constrained convex optimization problems with indicator variables, Approximated perspective relaxations: a project and lift approach
Uses Software
