A unified matheuristic for solving multi-constrained traveling salesman problems with profits
EURO Journal on Computational Optimization, 2017 In this paper, we address a rich Traveling Salesman Problem with Profits encountered in several real-life cases. We propose a unified solution approach based on variable neighborhood search.
Rahma Lahyani +2 more
doaj
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
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
Implicitly and densely discrete black-box optimization problems [PDF]
, 2008 This paper addresses derivative-free optimization problems where the variables lie implicitly in an unknown discrete closed set. The evaluation of the objective function follows a projection onto the discrete set, which is assumed dense rather than ...
Vicente, L. N.
core +5 more sources
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
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
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
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
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