Results 1 to 10 of about 118 (48)
An exploratory computational analysis of dual degeneracy in mixed-integer programming
EURO Journal on Computational Optimization, 2020 Dual degeneracy, i.e., the presence of multiple optimal bases to a linear programming (LP) problem, heavily affects the solution process of mixed integer programming (MIP) solvers. Different optimal bases lead to different cuts being generated, different
Gerald Gamrath +2 more
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
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
A linear time algorithm for a variant of the max cut problem in series parallel graphs [PDF]
, 2017 Given a graph $G=(V, E)$, a connected sides cut $(U, V\backslash U)$ or $\delta (U)$ is the set of edges of E linking all vertices of U to all vertices of $V\backslash U$ such that the induced subgraphs $G[U]$ and $G[V\backslash U]$ are connected.
Chaourar, Brahim
core +3 more sources
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 +1 more source
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 +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
Certificates of infeasibility via nonsmooth optimization [PDF]
, 2015 An important aspect in the solution process of constraint satisfaction problems is to identify exclusion boxes which are boxes that do not contain feasible points.
Fendl, Hannes +2 more
core +2 more sources
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 +1 more source
Symmetric, Hankel-symmetric, and Centrosymmetric Doubly Stochastic Matrices [PDF]
, 2017 We investigate convex polytopes of doubly stochastic matrices having special structures: symmetric, Hankel symmetric, centrosymmetric, and both symmetric and Hankel symmetric.
Brualdi, Richard R., Cao, Lei
core +3 more sources