Results 31 to 40 of about 502 (85)
The Langevin Approach: a simple stochastic method for complex phenomena
, 2015 We describe a simple stochastic method, so-called Langevin approach, which enables one to extract evolution equations of stochastic variables from a set of measurements.
Fuchs, André +5 more
core +1 more source
On the Caratheodory rank of polymatroid bases [PDF]
, 2010 In this paper we prove that the Carath\'eodory rank of the set of bases of a (poly)matroid is upper bounded by the cardinality of the ground set.Comment: 7 ...
Gijswijt, Dion, Regts, Guus
core
Integer Polynomial Optimization in Fixed Dimension
, 2004 We classify, according to their computational complexity, integer optimization problems whose constraints and objective functions are polynomials with integer coefficients and the number of variables is fixed.
Barvinok A. I. +9 more
core +4 more sources
Polyhedra with the Integer Caratheodory Property [PDF]
, 2010 A polyhedron P has the Integer Caratheodory Property if the following holds. For any positive integer k and any integer vector w in kP, there exist affinely independent integer vectors x_1,...,x_t in P and positive integers n_1,...,n_t such that n_1 ...
Gijswijt, Dion, Regts, Guus
core
On quasistability radius of a vector trajectorial problem with a principle of optimality generalizing Pareto and lexicographic principles [PDF]
Computer Science Journal of Moldova, 2005 A multicriterion linear combinatorial problem with a parametric principle of optimality is considered. This principle is defined by a partitioning of partial criteria onto Pareto preference relation groups within each group and the lexicographic ...
Sergey E. Bukhtoyarov +1 more
doaj
Mobility offer allocations in corporate settings
EURO Journal on Computational Optimization, 2021 Corporate mobility is often based on a fixed assignment of vehicles to employees. Relaxing this fixation and including alternatives such as public transportation or taxis for business and private trips could increase fleet utilization and foster the use ...
Sebastian Knopp +2 more
doaj
Another pedagogy for mixed-integer Gomory
EURO Journal on Computational Optimization, 2017 We present a version of GMI (Gomory mixed-integer) cuts in a way so that they are derived with respect to a “dual form” mixed-integer optimization problem and applied on the standard-form primal side as columns, using the primal simplex algorithm.
Jon Lee, Angelika Wiegele
doaj
An exploratory computational analysis of dual degeneracy in mixed-integer programming
EURO Journal on Computational Optimization, 2020 Dual degeneracy, i.e., the presence of multiple optimal bases to a linear programming (LP) problem, heavily affects the solution process of mixed integer programming (MIP) solvers. Different optimal bases lead to different cuts being generated, different
Gerald Gamrath +2 more
doaj
A polyhedral approach to the generalized minimum labeling spanning tree problem
EURO Journal on Computational Optimization, 2019 The minimum labeling spanning tree problem (MLSTP) is a combinatorial optimization problem that consists in finding a spanning tree in a simple graph G, in which each edge has one label, by using a minimum number of labels.
ThiagoGouveiada Silva +4 more
doaj
On the convergence of the affine hull of the Chv\'atal-Gomory closures
, 2012 Given an integral polyhedron P and a rational polyhedron Q living in the same n-dimensional space and containing the same integer points as P, we investigate how many iterations of the Chv\'atal-Gomory closure operator have to be performed on Q to obtain
Averkov, Gennadiy +4 more
core +1 more source