Results 31 to 40 of about 385 (87)
Presolving linear bilevel optimization problems
EURO Journal on Computational Optimization, 2021 Linear bilevel optimization problems are known to be strongly NP-hard and the computational techniques to solve these problems are often motivated by techniques from single-level mixed-integer optimization.
Thomas Kleinert +3 more
doaj
Ten years of feasibility pump, and counting
EURO Journal on Computational Optimization, 2019 The Feasibility Pump (fp) is probably the best-known primal heuristic for mixed-integer programming. The original work by Fischetti et al. (Math Program 104(1):91–104, 2005), which introduced the heuristic for 0–1 mixed-integer linear programs, has been ...
Timo Berthold +2 more
doaj
Two-row and two-column mixed-integer presolve using hashing-based pairing methods
EURO Journal on Computational Optimization, 2020 In state-of-the-art mixed-integer programming solvers, a large array of reduction techniques are applied to simplify the problem and strengthen the model formulation before starting the actual branch-and-cut phase.
Patrick Gemander +5 more
doaj
Implicitly and densely discrete black-box optimization problems [PDF]
, 2008 This paper addresses derivative-free optimization problems where the variables lie implicitly in an unknown discrete closed set. The evaluation of the objective function follows a projection onto the discrete set, which is assumed dense rather than ...
Vicente, L. N.
core
Uncapacitated Lot-Sizing with Stock Upper Bounds, Stock Fixed Costs, Stock Overloads and Backlogging: A Tight Formulation [PDF]
, 2015 For an n-period uncapacitated lot-sizing problem with stock upper bounds, stock fixed costs, stock overload and backlogging, we present a tight extended shortest path formulation of the convex hull of solutions with O(n^2) variables and constraints, also
Wolsey, Laurence
core
Optimal capacitated ring trees
EURO Journal on Computational Optimization, 2016 We study a new network design model combining ring and tree structures under capacity constraints. The solution topology of this capacitated ring tree problem (CRTP) is based on ring trees which are the union of trees and 1-trees.
Alessandro Hill, Stefan Voß
doaj
Switch 2.0: A modern platform for planning high-renewable power systems
SoftwareX, 2019 Switch 2.0 is an open-source platform for planning transitions to low-emission electric power systems, designed to satisfy 21st century grid planning requirements.
Josiah Johnston +3 more
doaj
A Survey on Mixed-Integer Programming Techniques in Bilevel Optimization
EURO Journal on Computational Optimization, 2021 Bilevel optimization is a field of mathematical programming in which some variables are constrained to be the solution of another optimization problem. As a consequence, bilevel optimization is able to model hierarchical decision processes.
Thomas Kleinert +3 more
doaj
Stabilized Benders methods for large-scale combinatorial optimization, with appllication to data privacy [PDF]
, 2017 The Cell Suppression Problem (CSP) is a challenging Mixed-Integer Linear Problem arising in statistical tabular data protection. Medium sized instances of CSP involve thousands of binary variables and million of continuous variables and constraints ...
Baena, Daniel +2 more
core +1 more source
Sufficient pruning conditions for MINLP in gas network design
EURO Journal on Computational Optimization, 2017 One-quarter of Europe’s energy demand is provided by natural gas distributed through a vast pipeline network covering the whole of Europe. At a cost of 1 million Euros per kilometer the extension of the European pipeline network is already a multi ...
Jesco Humpola, Felipe Serrano
doaj