Results 41 to 50 of about 297 (63)

On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs. [PDF]

Math Program
Gaar E, Lee J, Ljubić I, Sinnl M, Tanınmış K.   +4 more
europepmc   +1 more source

On Tractable Convex Relaxations of Standard Quadratic Optimization Problems under Sparsity Constraints. [PDF]

J Optim Theory Appl
Bomze I, Peng B, Qiu Y, Yıldırım EA.
europepmc   +1 more source

Polyhedral results for the edge capacity polytope. [PDF]

Hoesel, Stan P.M. van, Koster, Arie M.C.A., Leensel, Robert L.M.J. van de, Savelsbergh, Martin W.P.   +3 more
core   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Bi-level mixed-integer planning for electricity-hydrogen integrated energy system considering levelized cost of hydrogen

Applied Energy, 2020
Wei Gu, Haifeng Qiu, Zhi Wu
exaly  

Minimum Loss Network Reconfiguration Using Mixed-Integer Convex Programming

IEEE Transactions on Power Systems, 2012
Rabih A Jabr
exaly  

Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions

Operations Research, 2010
Shabbir Ahmed
exaly  

SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework

Optimization Methods and Software, 2018
Stefan Vigerske, Ambros M Gleixner
exaly  

Combinatorial Benders' Cuts for Mixed-Integer Linear Programming

Operations Research, 2006
Matteo Fischetti
exaly  

Solving Mixed Integer Bilinear Problems Using MILP Formulations

SIAM Journal on Optimization, 2013
Akshay Gupte, Shabbir Ahmed
exaly