Results 41 to 50 of about 493 (95)
EURO Journal on Computational Optimization, 2018 Many practical combinatorial optimization problems can be described by integer linear programs having an exponential number of variables, and they are efficiently solved by column generation algorithms.
Christian Artigues +2 more
doaj +1 more source
Improving strong branching by domain propagation
EURO Journal on Computational Optimization, 2014 One of the essential components of a branch-and-bound based mixed-integer linear programming (MIP) solver is the branching rule. Strong branching is a method used by many state-of-the-art branching rules to select the variable to branch on.
Gerald Gamrath
doaj +1 more source
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
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
A computational comparison of several formulations for the multi-period incremental service facility location problem [PDF]
, 2010 The Multi-period Incremental Service Facility Location Problem, which was recently introduced, is a strategic problem for timing the location of facilities and the assignment of customers to facilities in a multi-period environment. Aiming at finding the
Albareda Sambola, María +5 more
core
Integer Points in Knapsack Polytopes and s-covering Radius [PDF]
, 2012 Given an integer matrix A satisfying certain regularity assumptions, we consider for a positive integer s the set F_s(A) of all integer vectors b such that the associated knapsack polytope P(A,b)={x: Ax=b, x non-negative} contains at least s integer ...
Aliev, Iskander +2 more
core +1 more source
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
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
Lotsize optimization leading to a $p$-median problem with cardinalities [PDF]
, 2007 We consider the problem of approximating the branch and size dependent demand of a fashion discounter with many branches by a distributing process being based on the branch delivery restricted to integral multiples of lots from a small set of available ...
Gaul, Constantin +2 more
core +2 more sources