Results 261 to 270 of about 773,474 (304)
Some of the next articles are maybe not open access.
A note on branch-and-cut-and-price
Operations Research Letters, 2010zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Feillet, Dominique +3 more
openaire +3 more sources
Branch and Price for Chance-Constrained Bin Packing
INFORMS Journal on Computing, 2020This 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
Taxi planning: Branch and price decomposition
Proceedings of the Institution of Mechanical Engineers, Part G: Journal of Aerospace Engineering, 2018Taxi 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
Constrained shortest path tour problem: Branch-and-Price algorithm
Computers & Operations Research, 2022zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Martin, Sébastien +3 more
openaire +2 more sources
2004
In this chapter, we present an overview of constraint programming based branch-and-price, a combined integer programming-constraint programming algorithm used to solve combinatorial problems formulated with a huge number of variables. We discuss a number of applications and implementation issues.
Kelly Easton +2 more
openaire +1 more source
In this chapter, we present an overview of constraint programming based branch-and-price, a combined integer programming-constraint programming algorithm used to solve combinatorial problems formulated with a huge number of variables. We discuss a number of applications and implementation issues.
Kelly Easton +2 more
openaire +1 more source
Branch-and-Price for Personalized Multiactivity Tour Scheduling
INFORMS Journal on Computing, 2016This 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, 2012AbstractWe 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
Branch-and-Price Guided Search
2012When solving large-scale integer programming (IP) models, there are the conflicting goals of solution quality and solution time. Solving realistic-size instances of many problems to optimality is still beyond the capability of state-of-the-art solvers.
Mike Hewitt +2 more
openaire +1 more source
Sorting Permutations by Reversals Through Branch-and-Price
INFORMS Journal on Computing, 2001We describe an exact algorithm for the problem of sorting a permutation by the minimum number of reversals, originating from evolutionary studies in molecular biology. Our approach is based on an integer linear programming formulation of a graph-theoretic relaxation of the problem, calling for a decomposition of the edge set of a bicolored graph into ...
CAPRARA A., LANCIA, Giuseppe, NG S. K.
openaire +2 more sources
Designing WDM Optical Networks Using Branch-and-Price
Journal of Mathematical Modelling and Algorithms in Operations Research, 2013zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Raghavan, S., Stanojević, Daliborka
openaire +2 more sources