Results 21 to 30 of about 132 (51)
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
A conical branch-and-bound algorithm for a class of reverse convex programs [PDF]
, 2005 technical ...
KUNO Takahito, Nagai Hidetoshi
core
Linear Programming Relaxations of Quadratically Constrained Quadratic Programs
, 2011 We investigate the use of linear programming tools for solving semidefinite programming relaxations of quadratically constrained quadratic problems. Classes of valid linear inequalities are presented, including sparse PSD cuts, and principal minors PSD ...
Belotti, Pietro +2 more
core +2 more sources
Planeación de sistemas secundarios de distribución usando el algoritmo Branch and Bound
Ingeniería y Ciencia, 2011 En este trabajo se plantea una metodología para la solución del problema delplaneamiento de sistemas secundarios de distribución considerando un modelode programación lineal entero mixto (PLEM), el cual considera la ubicación y dimensionamiento de ...
Carlos Javier Tapias-Isaza +2 more
doaj
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
Ten years of feasibility pump, and counting
EURO Journal on Computational Optimization, 2019 The Feasibility Pump (fp) is probably the best-known primal heuristic for mixed-integer programming. The original work by Fischetti et al. (Math Program 104(1):91–104, 2005), which introduced the heuristic for 0–1 mixed-integer linear programs, has been ...
Timo Berthold +2 more
doaj
A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints
EURO Journal on Computational Optimization, 2017 This paper provides the convex hull description of the single thermal Unit Commitment (UC) problem with the following basic operating constraints: (1) generation limits, (2) start-up and shut-down capabilities, and (3) minimum up and down times.
C. Gentile, G. Morales-España, A. Ramos
doaj
Border bases and order ideals: a polyhedral characterization
, 2015 Border bases arise as a canonical generalization of Gr\"obner bases. We provide a polyhedral characterization of all order ideals (and hence border bases) that are supported by a zero-dimensional ideal: order ideals that support a border basis correspond
Braun, Gábor, Pokutta, Sebastian
core +1 more source
The summed start-up costs in a unit commitment problem
EURO Journal on Computational Optimization, 2017 We consider the sum of the incurred start-up costs of a single unit in a Unit Commitment problem. Our major result is a correspondence between the facets of its epigraph and some binary trees for concave start-up cost functions CU, which is bijective if ...
René Brandenberg +2 more
doaj
EURO Journal on Computational Optimization, 2017 The generalized directed rural postman problem is an arc routing problem with many interesting real-life applications, such as routing for meter reading. In this application, a vehicle with a receiver travels through a series of neighborhoods.
Thais Ávila +3 more
doaj