Results 131 to 140 of about 221 (153)
Some of the next articles are maybe not open access.
Robust codebook-based downlink beamforming using mixed integer conic programming
2013 IEEE International Conference on Acoustics, Speech and Signal Processing, 2013This paper considers robust codebook-based downlink beamforming (i.e., single-layer precoding), where the beamformer of each user is chosen from a fixed beamformer codebook defined, e.g., in LTE and LTE-A. Admission control and power allocation are embedded in the precoding vector selection procedure.
Yong Cheng, Marius Pesavento
openaire +1 more source
Symmetry Detection in Mixed-Integer Conic Programming
Mathematical Programming Computationexaly +2 more sources
Joint Discrete Rate Adaptation and Downlink Beamforming Using Mixed Integer Conic Programming
IEEE Transactions on Signal Processing, 2015Multiuser downlink beamforming for sum-rate maximization has been intensively studied in the literature assuming that the achievable data rates of the mobile stations (MSs) are continuous and strictly increasing functions of the received signal-to-interference-plus-noise ratios (SINRs).
Yong Cheng, Marius Pesavento
openaire +1 more source
Fractional 0–1 programs: links between mixed-integer linear and conic quadratic formulations
Journal of Global Optimization, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Erfan Mehmanchi +2 more
openaire +1 more source
IEEE Transactions on Signal Processing, 2013
Coordinated multipoint (CoMP) transmission is a promising technique to mitigate intercell interference and to increase system throughput in single-frequency reuse networks. Despite the remarkable benefits, the associated operational costs for exchanging user data and control information between multiple cooperating base stations (BSs) limit practical ...
Yong Cheng +2 more
openaire +1 more source
Coordinated multipoint (CoMP) transmission is a promising technique to mitigate intercell interference and to increase system throughput in single-frequency reuse networks. Despite the remarkable benefits, the associated operational costs for exchanging user data and control information between multiple cooperating base stations (BSs) limit practical ...
Yong Cheng +2 more
openaire +1 more source
2012 47th International Universities Power Engineering Conference (UPEC), 2012
This paper introduces a mixed-integer conic programming approach to solve the optimal capacitor placement problem in radial distribution networks. The problem is formulated to allow optimally placing fixed and switched-type capacitors; its objective is to minimize the peak power losses, the energy losses, and the costs associated with the required ...
Rabih Jabr
exaly +2 more sources
This paper introduces a mixed-integer conic programming approach to solve the optimal capacitor placement problem in radial distribution networks. The problem is formulated to allow optimally placing fixed and switched-type capacitors; its objective is to minimize the peak power losses, the energy losses, and the costs associated with the required ...
Rabih Jabr
exaly +2 more sources
Valid Inequalities for Mixed-Integer Linear and Mixed-Integer Conic Programs
2016Mixed-integer programming provides a natural framework for modeling optimization problems which require discrete decisions. Valid inequalities, used as cutting-planes and cuttingsurfaces in integer programming solvers, are an essential part of today’s integer programming technology.
openaire +1 more source
Optimal placement of capacitors in a radial network using conic and mixed integer linear programming
Electric Power Systems Research, 2008This paper considers the problem of optimally placing fixed and switched type capacitors in a radial distribution network. The aim of this problem is to minimize the costs associated with capacitor banks, peak power, and energy losses whilst satisfying a pre-specified set of physical and technical constraints.
exaly +2 more sources
Mixed-Integer Conic Linear Programming: Challenges and Perspectives
2013Abstract : Fundamental Disjunctive Conic Cut (DCC) methodology for Mixed-Integer Conic Linear Optimization (MICO) was developed. To describe the convex hull of the intersection of a convex set E and a linear disjunction is the fundamental problem, and that served as the core of solution techniques for MICO.
openaire +1 more source