A review and comparison of solvers for convex MINLP
In this paper, we present a review of deterministic software for solving convex MINLP
problems as well as a comprehensive comparison of a large selection of commonly …
problems as well as a comprehensive comparison of a large selection of commonly …
Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
This manuscript reviews recent advances in deterministic global optimization for Mixed-
Integer Nonlinear Programming (MINLP), as well as Constrained Derivative-Free …
Integer Nonlinear Programming (MINLP), as well as Constrained Derivative-Free …
Mixed-integer nonlinear optimization
Many optimal decision problems in scientific, engineering, and public sector applications
involve both discrete decisions and nonlinear system dynamics that affect the quality of the …
involve both discrete decisions and nonlinear system dynamics that affect the quality of the …
Adaptive wireless video streaming based on edge computing: Opportunities and approaches
Dynamic Adaptive Streaming over HTTP (DASH) has been widely adopted to deal with such
user diversity as network conditions and device capabilities. In DASH systems, the …
user diversity as network conditions and device capabilities. In DASH systems, the …
Juniper: An open-source nonlinear branch-and-bound solver in Julia
Nonconvex mixed-integer nonlinear programs (MINLPs) represent a challenging class of
optimization problems that often arise in engineering and scientific applications. Because of …
optimization problems that often arise in engineering and scientific applications. Because of …
[图书][B] Heuristic algorithms in global MINLP solvers
T Berthold - 2015 - zib.de
In the literature for mixed integer programming, heuristic algorithms (particularly primal
heuristics) are often considered as stand-alone procedures; in that context, heuristics are …
heuristics) are often considered as stand-alone procedures; in that context, heuristics are …
Joint optimization of source power allocation and distributed relay beamforming in multiuser peer-to-peer relay networks
Y Cheng, M Pesavento - IEEE Transactions on Signal …, 2012 - ieeexplore.ieee.org
In this paper, we consider the joint optimization of the source power allocation and relay
beamforming weights in distributed multiuser peer-to-peer (MUP2P) relay networks applying …
beamforming weights in distributed multiuser peer-to-peer (MUP2P) relay networks applying …
Joint beamforming and power allocation for secrecy in peer-to-peer relay networks
This paper investigates the physical-layer security of a multiuser peer-to-peer (MUP2P) relay
network for amplify-and-forward (AF) protocol, where a secure user and other unclassified …
network for amplify-and-forward (AF) protocol, where a secure user and other unclassified …
RENS: the optimal rounding
T Berthold - Mathematical Programming Computation, 2014 - Springer
This article introduces rens, the relaxation enforced neighborhood search, a large
neighborhood search algorithm for mixed integer nonlinear programs (MINLPs). It uses a …
neighborhood search algorithm for mixed integer nonlinear programs (MINLPs). It uses a …
Proximity search for 0-1 mixed-integer convex programming
M Fischetti, M Monaci - Journal of Heuristics, 2014 - Springer
In this paper we investigate the effects of replacing the objective function of a 0-1 mixed-
integer convex program (MIP) with a “proximity” one, with the aim of using a black-box solver …
integer convex program (MIP) with a “proximity” one, with the aim of using a black-box solver …