A branch-and-cut algorithm for the target visitation problem
EURO Journal on Computational Optimization, 2019 In this paper, we consider the target visitation problem (TVP) which arises in the context of disaster treatment. Mathematically speaking, the problem is concerned with finding a route to visit a set of targets starting from and returning to some base ...
Achim Hildenbrandt
doaj +1 more source
Investigation of the structure and catalytic activity in olefin cyclopropanation of neutral and cationic dicopper complexes of 3,5-bis(pyridinylimino)benzoic acid. [PDF]
, 2012 Three neutral and one cationic copper(I) complexes with 3,5-bis(pyridinylimino)benzoic acid are synthesized and characterized in solution and in the solid state by a variety of spectroscopic techniques and X-ray crystallography.
Akrivos, P. +5 more
core +1 more source
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
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
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
Consistencia en la desagregación de la población. El problema del ruido y el age heaping [PDF]
, 2016 La población desagregada en edad simple es una herramienta básica para las oficinas estadísticas, pues es usada, por ejemplo, como denominador en el cálculo de indicadores.
Bermúdez Parrado, Silvia +1 more
core
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
An SDP Approach For Solving Quadratic Fractional Programming Problems [PDF]
, 2014 This paper considers a fractional programming problem (P) which minimizes a ratio of quadratic functions subject to a two-sided quadratic constraint. As is well-known, the fractional objective function can be replaced by a parametric family of quadratic ...
Nguyen, Van-Bong +2 more
core