An exact approach for the multi-constraint graph partitioning problem
EURO Journal on Computational Optimization, 2020 In this work, a multi-constraint graph partitioning problem is introduced. The input is an undirected graph with costs on the edges and multiple weights on the nodes. The problem calls for a partition of the node set into a fixed number of clusters, such
Diego Recalde, Ramiro Torres, Polo Vaca
doaj +1 more source
Tropical determinant on transportation polytope [PDF]
, 2014 Let ${\mathcal D}^{k,l}(m,n)$ be the set of all the integer points in the transportation polytope of $kn\times ln$ matrices with row sums $lm$ and column sums $km$.
Gajula, Sailaja +2 more
core +3 more sources
Network flow optimization for restoration of images
Journal of Applied Mathematics, Volume 2, Issue 4, Page 199-218, 2002., 2002 The network flow optimization approach is offered for restoration of gray‐scale and color images corrupted by noise. The Ising models are used as a statistical background of the proposed method. We present the new multiresolution network flow minimum cut algorithm, which is especially efficient in identification of the maximum a posteriori (MAP ...
Boris A. Zalesky
wiley +1 more source
Quasi-stability of a vector trajectorial problem with non-linear partial criteria [PDF]
Computer Science Journal of Moldova, 2003 Multi-objective (vector) combinatorial problem of finding the Pareto set with four kinds of non-linear partial criteria is considered. Necessary and sufficient conditions of that kind of stability of the problem (quasi-stability) are obtained.
Vladimir A. Emelichev +1 more
doaj
International Journal of Mathematics and Mathematical Sciences, Volume 11, Issue 4, Page 811-814, 1988., 1988 This paper suggests a method of formulating any nonlinear integer programming problem, with any number of constraints, as an equivalent single constraint problem, thus reducing the dimensionality of the associated dynamic programming problem.
Balasubramanian Ram, A. J. G. Babu
wiley +1 more source
Formulations and algorithms for the recoverable Γ-robust knapsack problem
EURO Journal on Computational Optimization, 2019 One of the most frequently occurring substructures in integer linear programs (ILPs) is the knapsack constraint. In this paper, we study ways to deal with uncertainty in the coefficients of such constraints.
Christina Büsing +3 more
doaj +1 more source
On quasistability of a vector combinatorial problem with \Sigma-MINMAX and \Sigma-MINMIN partial criteria [PDF]
Computer Science Journal of Moldova, 2004 We consider one type of stability (quasistability) of a vector combinatorial problem of finding the Pareto set. Under quasistability we understand a discrete analogue of lower semicontinuity by Hausdorff of the many-valued mapping, which defines the ...
Vladimir A. Emelichev +2 more
doaj
A fast branch-and-bound algorithm for non-convex quadratic integer optimization subject to linear constraints using ellipsoidal relaxations [PDF]
, 2015 We propose two exact approaches for non-convex quadratic integer minimization subject to linear constraints where lower bounds are computed by considering ellipsoidal relaxations of the feasible set.
Buchheim, Christoph +2 more
core +1 more source
Measure of stability of a Pareto optimal solution to a vector integer programming problem with fixed surcharges in the l1 and l∞ metrics [PDF]
Computer Science Journal of Moldova, 2005 In this paper we consider a vector integer programming problem with Pareto principle of optimality for the case where partial criteria belong to the class of separable piecewise linear functions. The limit level of the initial data's perturbations in the
Vladimir A. Emelichev +2 more
doaj
An improved cut-and-solve algorithm for the single-source capacitated facility location problem
EURO Journal on Computational Optimization, 2018 In this paper, we present an improved cut-and-solve algorithm for the single-source capacitated facility location problem. The algorithm consists of three phases.
SuneLauth Gadegaard +2 more
doaj +1 more source