Results 41 to 50 of about 411 (101)
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
On global optimization with indefinite quadratics
EURO Journal on Computational Optimization, 2017 We present an algorithmic framework for global optimization problems in which the non-convexity is manifested as an indefinite-quadratic as part of the objective function.
Marcia Fampa, Jon Lee, Wendel Melo
doaj +1 more source
Matheuristics for optimizing the network in German wagonload traffic
EURO Journal on Computational Optimization, 2017 In this paper, we consider a capacitated multiple allocation hub location problem derived from a practical application in network design of German wagonload traffic.
Julia Sender +3 more
doaj +1 more source
Unbounded convex sets for non-convex mixed-integer quadratic programming [PDF]
, 2014 This paper introduces a fundamental family of unbounded convex sets that arises in the context of non-convex mixed-integer quadratic programming.
Burer, Samuel, Letchford, Adam
core
Stabilized Benders methods for large-scale combinatorial optimization, with appllication to data privacy [PDF]
, 2017 The Cell Suppression Problem (CSP) is a challenging Mixed-Integer Linear Problem arising in statistical tabular data protection. Medium sized instances of CSP involve thousands of binary variables and million of continuous variables and constraints ...
Baena, Daniel +2 more
core +1 more source
Solving wind farm layout optimization with mixed integer programs and constraint programs
EURO Journal on Computational Optimization, 2014 The wind farm layout optimization problem is concerned with the optimal location of turbines within a fixed geographical area to maximize profit under stochastic wind conditions. Previously, it has been modeled as a maximum diversity (or p-dispersion-sum)
PeterY. Zhang +3 more
doaj +1 more source
Uncapacitated Lot-Sizing with Stock Upper Bounds, Stock Fixed Costs, Stock Overloads and Backlogging: A Tight Formulation [PDF]
, 2015 For an n-period uncapacitated lot-sizing problem with stock upper bounds, stock fixed costs, stock overload and backlogging, we present a tight extended shortest path formulation of the convex hull of solutions with O(n^2) variables and constraints, also
Wolsey, Laurence
core
Optimizing compatible sets in wireless networks through integer programming
EURO Journal on Computational Optimization, 2014 In wireless networks, the notion of compatible set refers to a set of radio links that can be simultaneously active with a tolerable interference. Finding a compatible set with maximum weighted revenue from the parallel transmissions is an important ...
Yuan Li +3 more
doaj +1 more source
EURO Journal on Computational Optimization, 2017 This paper elaborates compact MIP formulations for a discrete unit commitment problem with minimum stop and ramping constraints. The variables can be defined in two different ways.
Nicolas Dupin
doaj +1 more source
Electric Vehicle Routing Problem: A Review of Recent Approaches and Algorithms
Studia Universitatis Babes-Bolyai: Series InformaticaWith the rapid advancement of new energy vehicles, electric vehicles (EVs) have become integral to modern transportation systems. Compared with traditional fuel vehicles, EVs are limited by their limited battery capacity and require reasonable charging ...
Yingkai XU
doaj +1 more source