Results 21 to 30 of about 9,957 (290)
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
Column Generation Algorithm: A revision from its application to the Student Assignation Problem
Revista Facultad de Ingeniería Universidad de Antioquia, 2013 The Column Generation Algorithm (CGA) is commonly cited in the bibliography as alternative to solve large scale optimization problems. This article deals with the description of the GC algorithm in the context of the student assignation to the public ...
Pablo Andrés Maya
doaj +1 more source
Solving an airport ground service task assignment problem with an exact algorithm.
PLoS ONE, 2022 In this paper, an airport ground service task assignment problem is studied. A task represents a service, which must be performed by one or multiple ground crew of a shift with required qualification/proficiency within a prescribed time period. For every
Qiannan Tian +3 more
doaj +1 more source
A Branch-and-Price Algorithm for Balancing Two-Sided Assembly Lines with Zoning Constraints
Journal of Mathematics, 2021 Two-sided assembly lines are widely used in the large-size product manufacturing industry, especially for automotive assembly production. Balancing the assembly line is significant for assembly process planning and assembly production.
Qidong Yin +2 more
doaj +1 more source
A branch-and-price algorithm for the Minimum Sum Coloring Problem
Discrete Applied Mathematics, 2021 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Diego Delle Donne +3 more
openaire +2 more sources
The rank pricing problem: Models and branch-and-cut algorithms [PDF]
Computers & Operations Research, 2019 One of the main concerns in management and economic planning is to sell the right product to the right customer for the right price. Companies in retail and manufacturing employ pricing strategies to maximize their revenues. The Rank Pricing Problem considers a unit-demand model with unlimited supply and uniform budgets in which customers have a rank ...
Herminia I. Calvete +4 more
openaire +7 more sources
Close-Enough Facility Location
Mathematics, 2021 This paper introduces the concept of close-enough in the context of facility location. It is assumed that customers are willing to move from their homes to close-enough pickup locations.
Alejandro Moya-Martínez +2 more
doaj +1 more source
A branch-and-price algorithm for the Minimum Latency Problem
Computers & Operations Research, 2018 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Teobaldo Bulhões +2 more
openaire +1 more source
Tactical fixed job scheduling with spread-time constraints [PDF]
, 2014 We address the tactical fixed job scheduling problem with spread-time constraints. In such a problem, there are a fixed number of classes of machines and a fixed number of groups of jobs.
Zhang, Xiandong +3 more
core +1 more source
A branch-and-price algorithm for the windy rural postman problem [PDF]
RAIRO - Operations Research, 2011 Summary: We propose an exact solution method for the windy rural postman problem (WRPP). The motivation to study this problem comes from some real-life applications, such as garbage collecting in a predefined sector with hills, where the traversing or the servicing speed can change following the direction. We present a Dantzig-Wolfe decomposition and a
Afsar, Hasan Murat +2 more
openaire +5 more sources