Results 21 to 30 of about 104 (98)
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 +1 more source
Improved integral simplex using decomposition for the set partitioning problem
EURO Journal on Computational Optimization, 2018 Integral simplex using decomposition (ISUD) is a method that efficiently solves set partitioning problems. It is an iterative method that starts from a known integer solution and moves through a sequence of integer solutions, decreasing the cost at each ...
Abdelouahab Zaghrouti +2 more
doaj +1 more source
The complete vertex p-center problem
EURO Journal on Computational Optimization, 2020 The vertex p-center problem consists of locating p facilities among a set of M potential sites such that the maximum distance from any demand to its closest located facility is minimized.
F.Antonio Medrano
doaj +1 more source
Intersection cuts from multiple rows: a disjunctive programming approach
EURO Journal on Computational Optimization, 2013 We address the issue of generating cutting planes for mixed integer programs from multiple rows of the simplex tableau with the tools of disjunctive programming.
Egon Balas, Andrea Qualizza
doaj +1 more source
Stop location design in public transportation networks: covering and accessibility objectives [PDF]
, 2006 Location, Public transportation, Covering, Accessibility, 90B80, 90C10, 90C35, 90B20,
Poetranto, Dwi Retnani +9 more
core +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
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
Method for solving a convex integer programming problem
International Journal of Mathematics and Mathematical Sciences, Volume 2003, Issue 44, Page 2829-2834, 2003., 2003 We consider a convex integer program which is a nonlinear version of the assignment problem. This problem is reformulated as an equivalent problem. An algorithm for solving the original problem is suggested which is based on solving the simple assignment problem via some of known algorithms.
Stefan M. Stefanov
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
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