Results 1 to 10 of about 465 (77)
Advances in Industrial and Manufacturing Engineering, 2021 The cutting process is an important stage of the industries which are dealing with cutting of small pieces from large items in such a way so that the wastage should be minimum.
Ravi Vishwakarma, P.L. Powar
doaj +1 more source
High accuracy semidefinite programming bounds for kissing numbers [PDF]
, 2009 The kissing number in n-dimensional Euclidean space is the maximal number of non-overlapping unit spheres which simultaneously can touch a central unit sphere.
Mittelmann, Hans D., Vallentin, Frank
core +7 more sources
Mobility offer allocations in corporate settings
EURO Journal on Computational Optimization, 2021 Corporate mobility is often based on a fixed assignment of vehicles to employees. Relaxing this fixation and including alternatives such as public transportation or taxis for business and private trips could increase fleet utilization and foster the use ...
Sebastian Knopp +2 more
doaj +1 more source
The distributions of functions related to parametric integer optimization [PDF]
, 2020 We consider the asymptotic distribution of the IP sparsity function, which measures the minimal support of optimal IP solutions, and the IP to LP distance function, which measures the distance between optimal IP and LP solutions.
Oertel, Timm +2 more
core +3 more sources
The response of hot wires in high Reynolds-number turbulent pipe flow [PDF]
, 2004 Issues concerning the accuracy of hot-wire measurements in turbulent pipe flow are addressed for pipe Reynolds numbers up to 6 × 106 and hot-wire Reynolds numbers up to Rew ap 250. These include the optimization of spatial and temporal resolution and the
Jiang, W. +4 more
core +1 more source
Another pedagogy for mixed-integer Gomory
EURO Journal on Computational Optimization, 2017 We present a version of GMI (Gomory mixed-integer) cuts in a way so that they are derived with respect to a “dual form” mixed-integer optimization problem and applied on the standard-form primal side as columns, using the primal simplex algorithm.
Jon Lee, Angelika Wiegele
doaj +1 more source
A polyhedral approach to the generalized minimum labeling spanning tree problem
EURO Journal on Computational Optimization, 2019 The minimum labeling spanning tree problem (MLSTP) is a combinatorial optimization problem that consists in finding a spanning tree in a simple graph G, in which each edge has one label, by using a minimum number of labels.
ThiagoGouveiada Silva +4 more
doaj +1 more source
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
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 +1 more source
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 +1 more source