Suchergebnisse - (mixed‐integer OR mixed‐internet) second‐order one programming problem*

Analysis of strategic bidding of a DER aggregator in energy markets through the Stackelberg game model with the mixed-integer lower-level problem von Lei, Zhenxing, Liu, Mingbo, Shen, Zhijun

“… of the distribution system (DS), which is elaborated by the mixed-integer second-order cone programming (MISOCP …”
Volltext

A New Mathematical Model for the Restoration Problem in Balanced Radial Distribution Systems von Romero, Ruben, Franco, John F., Leao, Fabio B., Rider, Marcos J., de Souza, Eliane S.

“… The restoration problem, originally modeled as mixed integer nonlinear programming, is transformed into a mixed integer second-order cone programming problem, which can be solved efficiently using …”
Volltext

Mixed-integer second-order cone programming framework for optimal scheduling of microgrids considering power flow constraints von Fu, Long, Meng, Ke, Liu, Bin, Dong, Zhao Yang

“… To address this concern, this study presents a mixed integer linear reformulation to characterise the operation of different …”
Volltext

Distributionally robust optimization of an emergency medical service station location and sizing problem with joint chance constraints von Liu, Kanglin, Li, Qiaofeng, Zhang, Zhi-Hai

“… •An EMS station location and sizing problem using distributionlly robust optimization is proposed …”
Volltext

Outer approximation with conic certificates for mixed-integer convex problems von Coey, Chris, Lubin, Miles, Vielma, Juan Pablo

“… A mixed-integer convex (MI-convex) optimization problem is one that becomes convex when all integrality constraints are relaxed …”
Volltext

Constructing Sustainable Humanitarian Relief Equity Allocation-Transportation Problem by Branch-and-Cut Algorithm von Wang, Jinpei, Ma, Xiaojuan, Bai, Xuejie, Liu, Yankui

“… Post-disaster relief equity allocation-transportation problem is a key issue in humanitarian logistics …”
Volltext

Perspective reformulations of mixed integer nonlinear programs with indicator variables von Günlük, Oktay, Linderoth, Jeff

“… We study mixed integer nonlinear programs (MINLP)s that are driven by a collection of indicator variables where each indicator variable controls a subset of the decision variables …”
Volltext

An Approximate Mixed-Integer Convex Model to Reduce Annual Operating Costs in Radial Distribution Networks Using STATCOMs von Montoya, Oscar Danilo, Alvarado-Barrios, Lázaro, Hernández, Jesus C.

“… The exact mixed-integer nonlinear programming model (MINLP) is decoupled into two convex optimization sub-problems, named the location problem and the sizing problem …”
Volltext

Ordered p-median problems with neighbourhoods von Blanco, Víctor

“… We present several mixed integer non-linear programming formulations for a wide family of objective functions which are common in Location Analysis: ordered median functions. We also develop two math-heuristic approaches for solving the problem. We report the results of extensive computational experiments …”
Volltext

Coordinating drones with mothership vehicles: The mothership and drone routing problem with graphs von Amorosi, Lavinia, Puerto, Justo, Valverde, Carlos

“… •Graphs arc routing problems with one drone and one mothership.•First mathematical formalization of the problem via MINLP formulations …”
Volltext

Hydrogen-Based Networked Microgrids Planning Through Two-Stage Stochastic Programming With Mixed-Integer Conic Recourse von Cao, Xiaoyu, Sun, Xunhang, Xu, Zhanbo, Zeng, Bo, Guan, Xiaohong

“… , RES generation, electric loads, and the refueling demands of hydrogen vehicles), we propose a two-stage stochastic formulation with mixed integer conic program (MICP) recourse decisions …”
Volltext

The Hampered k-Median Problem with Neighbourhoods von Puerto, Justo, Valverde, Carlos

“… Each one of these two elements, neighbours and barriers, makes the problems harder than their standard counterparts …”
Volltext

Data-driven distributionally robust chance-constrained optimization with Wasserstein metric von Ji, Ran, Lejeune, Miguel A.

“… For the continuum of realizations case with random right-hand side, we propose an exact mixed-integer second-order cone programming (MISOCP …”
Volltext

A nonlinear multidimensional knapsack problem in the optimal design of mixture experiments von Goos, P., Syafitri, U., Sartono, B., Vazquez, A.R.

“… •We propose a variable descent algorithm to compute D- and I-optimal designs.•We also propose a mixed integer nonlinear programming formulation …”
Volltext

Improved Rank-One-Based Relaxations and Bound Tightening Techniques for the Pooling Problem von Jalilian, Mosayeb, Kocuk, Burak

“… In this paper, we focus on a recently proposed rank-one-based formulation of the pooling problem …”
Volltext

Competitive hub location problem: Model and solution approaches von Tiwari, Richa, Jayaswal, Sachin, Sinha, Ankur

“… •We study the hub location problem faced by an airline entering a competitive market in single and multiple allocation network setting …”
Volltext

The robust multiple-choice multidimensional knapsack problem von Caserta, Marco, Voß, Stefan

“… •The robust formulation leads to a second order cone program.•Under mild assumptions, we show how the second order cone program can be transformed into a linear program …”
Volltext

Learning-Accelerated Exact Mixed-Integer Second-Order Cone Programming for Unit Commitment von Maisonneuve, Philippe

“… This results in these problems being best represented as mixed-integer second order cone programs (MISOCPs …”
Volltext

Damper placement optimization in a shear building model with discrete design variables: a mixed-integer second-order cone programming approach von Kanno, Yoshihiro

“… The damping coefficients of dampers are treated as discrete design variables. It is shown that a minimization problem of the sum of the transfer function amplitudes of the interstory drifts can be formulated as a mixed‐integer second …”
Volltext

Minimum cost b-matching problems with neighborhoods von Espejo, I., Páez, R., Puerto, J., Rodríguez-Chía, A. M.

“… : perfect, maximum cardinality, maximal and the a – b -matching problems. The theoretical complexity of solving each one of these problems is analyzed …”
Volltext