Results 251 to 260 of about 44,963 (303)

Scheduling sports leagues using branch- and price

open access: yes, 2006
A single round robin tournament can be described as a league of a set T of n teams (n even) to be scheduled such that each team plays exactly once against each other team and such that each team plays exactly once per period resulting in a set P of n — 1 periods. Matches are carried out at one of both opponents' stadiums.
Briskorn, Dirk, Drexl, Andreas
openaire   +2 more sources

Cutting planes for branch‐and‐price algorithms

Networks, 2011
AbstractThis article presents a general framework for formulating cutting planes in the context of column generation for integer programs. Valid inequalities can be derived using the variables of an equivalent compact formulation (i.e., the subproblem variables) or the master problem variables.
Desaulniers, Guy   +2 more
openaire   +1 more source

Branch-and-price for p-cluster editing

Computational Optimization and Applications, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bulhões, Teobaldo   +3 more
openaire   +1 more source

Branch and Price for Chance-Constrained Bin Packing

INFORMS Journal on Computing, 2020
This article describes two versions of the chance-constrained stochastic bin-packing (CCSBP) problem that consider item-to-bin allocation decisions in the context of chance constraints on the total item size within the bins. The first version is a stochastic CCSBP (SP-CCSBP) problem, which assumes that the distributions of item sizes are known.
Zhang, Zheng   +2 more
openaire   +3 more sources

Constrained shortest path tour problem: Branch-and-Price algorithm

Computers & Operations Research, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Martin, Sébastien   +3 more
openaire   +2 more sources

Taxi planning: Branch and price decomposition

Proceedings of the Institution of Mechanical Engineers, Part G: Journal of Aerospace Engineering, 2018
Taxi planning problem studies aircraft routing and scheduling on the airport ground. Taxi planning has been formulated using a binary multicommodity flow model in a space-time airport network. The flow capacity constraints are used to represent the conflicts among aircraft, given an airport’s capacity.
Luís C Ibanez, Angel G Marín
openaire   +1 more source

Branch-and-Price for Personalized Multiactivity Tour Scheduling

INFORMS Journal on Computing, 2016
This paper presents a branch-and-price approach to solve personalized tour-scheduling problems in a multiactivity context. Two formulations are considered. In the first, columns correspond to daily shifts that are modeled with context-free grammars, and tours are assembled in the master problem by means of extra constraints. In the second formulation,
Restrepo, María I.   +2 more
openaire   +1 more source

Stabilizing branch‐and‐price for constrained tree problems

Networks, 2012
AbstractWe consider a rather generic class of network design problems in which a set or subset of given terminal nodes must be connected to a dedicated root node by simple paths and a variety of resource and/or quality of service constraints must be respected.
Leitner, Markus   +2 more
openaire   +1 more source

Home - About - Disclaimer - Privacy