Results 21 to 30 of about 446 (78)
Applying ranking and selection procedures to long-term mitigation for improved network restoration
EURO Journal on Computational Optimization, 2016 In this paper, we consider methods to determine the best single arc mitigation plan for improving rapid recovery of a network with a given level of statistical certainty.
EmilyA. Heath +2 more
doaj +1 more source
Solving the maximum edge-weight clique problem in sparse graphs with compact formulations
EURO Journal on Computational Optimization, 2015 This paper studies the behavior of compact formulations for solving the maximum edge-weight clique (MEWC) problem in sparse graphs. The MEWC problem has long been discussed in the literature, but mostly addressing complete graphs, with or without a ...
Luis Gouveia, Pedro Martins
doaj +1 more source
Nash equilibria set computing in finite extended games [PDF]
Computer Science Journal of Moldova, 2006 he Nash equilibria set (NES) is described as an intersection of graphs of best response mappings. The problem of NES computing for multi-matrix extended games is considered. A method for NES computing is studied.
Valeriu Ungureanu
doaj
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 +1 more source
Fast algorithms for large scale generalized distance weighted discrimination [PDF]
, 2017 High dimension low sample size statistical analysis is important in a wide range of applications. In such situations, the highly appealing discrimination method, support vector machine, can be improved to alleviate data piling at the margin.
Lam, Xin Yee +3 more
core +3 more sources
EURO Journal on Computational Optimization, 2016 For many practical applications it is important to determine not only a numerical approximation of one but a representation of the whole set of globally optimal solutions of a non-convex optimization problem.
Gabriele Eichfelder +2 more
doaj +1 more source
Convex Programs for Temporal Verification of Nonlinear Dynamical Systems [PDF]
, 2007 A methodology for safety verification of continuous and hybrid systems using barrier certificates has been proposed recently. Conditions that must be satisfied by a barrier certificate can be formulated as a convex program, and the feasibility of the ...
Prajna, Stephen, Rantzer, Anders
core +1 more source
A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints
EURO Journal on Computational Optimization, 2017 This paper provides the convex hull description of the single thermal Unit Commitment (UC) problem with the following basic operating constraints: (1) generation limits, (2) start-up and shut-down capabilities, and (3) minimum up and down times.
C. Gentile, G. Morales-España, A. Ramos
doaj +1 more source
A Combinatorial Optimization Approach to the Selection of Statistical Units [PDF]
, 2015 In the case of some large statistical surveys, the set of units that will constitute the scope of the survey must be selected. We focus on the real case of a Census of Agriculture, where the units are farms.
BIANCHI, GIANPIERO +2 more
core +1 more source
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 +1 more source