Results 21 to 30 of about 3,531,799 (287)
Algorithms, 2022 The Cutting Stock Problem (CSP) is an optimisation problem that roughly consists of cutting large objects in order to produce small items. The computational effort for solving this problem is largely affected by the number of cutting patterns.
José Victor Sá Santos +1 more
doaj +1 more source
Family Column Generation: A Principled Stabilized Column Generation Approach
CoRR, 2021 We tackle the problem of accelerating column generation (CG) approaches to set cover formulations in operations research. At each iteration of CG we generate a dual solution that approximately solves the LP over all columns consisting of a subset of columns in the nascent set. We refer to this linear program (LP) as the Family Restricted Master Problem
Naveed Haghani +2 more
openaire +3 more sources
Advances in interior point methods and column generation [PDF]
, 2013 In this thesis we study how to efficiently combine the column generation technique (CG) and interior point methods (IPMs) for solving the relaxation of a selection of integer programming problems.
Brevis, Pablo, González Brevis, Pablo
core +3 more sources
Exploiting sparsity in pricing routines for the capacitated arc routing problem [PDF]
, 2009 The capacitated arc routing problem (CARP) is a well-known and fundamental vehicle routing problem. A promising exact solution approach to the CARP is to model it as a set covering problem and solve it via branch-cut-and-price.
Oukil, A, Letchford, A N
core +4 more sources
On Link Scheduling Under Blockage and Interference in 60-GHz Ad Hoc Networks
IEEE Access, 2015 In this paper, we tackle the problem of minimum time length link scheduling in 60-GHz ad hoc wireless networks using directional antennas with directional beamforming, under both traffic demand and signal to interference and noise ratio constraints. Both
Zhifeng He +2 more
doaj +1 more source
Robust Optimization for the Two-Dimensional Strip-Packing Problem with Variable-Sized Bins
Mathematics, 2023 The two-dimensional strip-packing problem (2D-SPP) emerges as a notable variant of the cutting and packing (C&P) problem, aiming to optimize the arrangement of small rectangular items within unique strips with a fixed width and infinite height to ...
Kaiyuan Liu +5 more
doaj +1 more source
Production, 2007 Este trabalho apresenta métodos de geração de colunas para dois importantes problemas de atribuição: o Problema Generalizado de Atribuição (PGA) e o Problema de Atribuição de Antenas a Comutadores (PAAC).
Edson Luiz França Senne +2 more
doaj +1 more source
Aperture Shape Generation Based on Gradient Descent With Momentum
IEEE Access, 2019 Direct aperture optimization (DAO) is an effective method to generate high-quality intensity-modulated radiation therapy treatment plans. In generic DAO, the direction of negative gradient descent is generally used to determine the aperture shape ...
Liyuan Zhang +4 more
doaj +1 more source
Semi rigid connections and their influence on steel column behaviour. [PDF]
, 1980 A review of the development of the analysis of frames with semi-rigid end restraint is given, including the treatment of frame stability and effective lengths. The available experimental data relating to the moment versus in-plane
Jones, Stephen Winford
core +6 more sources
The Angular Set Covering Problem
IEEE AccessWe present an innovative extension of the Set Covering Problem, transitioning from a traditional radial covering to an angular covering structure. The decisions are based on locating the facilities and identifying the directional servers installed in ...
Fredy Barriga-Gallegos +2 more
doaj +1 more source